IUScholarWorks (Indiana University) · 2014 · 67 citations · 7 references
Natural SciencesComputer ScienceMathematicsCombinatoricsDiscrete MathematicsSet TheoryCombinatorial Number TheoryCombinatorial Set TheoryAdditive PropertiesCap Sets
We provide an improvement over Meshulam's bound on cap sets in $F^{N}_{3}$. We show that there exist universal $\\epsilon > 0$ and $ C > 0$ so that any cap set in $F^{N}_{3}$ has size at most $C\\frac{3^{N}}{N^{1+e}}$. We do this by obtaining quite strong information about the additive combinatorial properties of the large spectrum.
7
Choice Reviews Online · 2007 · 212 citations
On Roth’s Theorem on Progressions
2011 · 163 citations
Near optimal bounds in Freiman's theorem
Tomasz Schoen · Duke Mathematical Journal · 2011 · 59 citations