Remote Access Journal of the American Mathematical Society
Green Open Access

Journal of the American Mathematical Society

ISSN 1088-6834(online) ISSN 0894-0347(print)



New bounds on cap sets

Authors: Michael Bateman and Nets Hawk Katz
Journal: J. Amer. Math. Soc. 25 (2012), 585-613
MSC (2010): Primary 11T71; Secondary 05D40
Published electronically: November 29, 2011
MathSciNet review: 2869028
Full-text PDF Free Access

Abstract | References | Similar Articles | Additional Information

Abstract: We provide an improvement over Meshulam's bound on cap sets in $ F_3^N$. We show that there exist universal $ \epsilon >0$ and $ C>0$ so that any cap set in $ F_3^N$ has size at most $ C {3^N \over N^{1+\epsilon }}$. We do this by obtaining quite strong information about the additive combinatorial properties of the large spectrum.

References [Enhancements On Off] (What's this?)

  • [CS11] E. Croot and O. Sisask, A Probabilistic Technique for Finding Almost-Periods of Convolutions, Geom. Funct. Anal. 20 (2010), 1367-1396. MR 2738997
  • [G] T. Gowers, What is difficult about the cap set problem?, 2011/01/11/what-is-difficult-about-the-cap-set-problem/.
  • [K1] (M. Bateman and) N.H. Katz, comment-10533.
  • [K2] (M. Bateman and) N.H. Katz, comment-10540.
  • [KK10] N. H. Katz and P. Koester, On Additive Doubling and Energy, SIAM J. Discrete Math. 24 (2010), 1684-1693. MR 2746716
  • [M95] R. Meshulam, On subsets of finite abelian groups with no $ 3$-term arithmetic progressions, J. Combin. Theory Ser. A 71 (1995), 168-172. MR 1335785 (96g:20033)
  • [PM] Polymath on wikipedia, _Project.
  • [PM6] Polymath 6: Improving the bounds for Roth's theorem, 2011/02/05/polymath6-improving-the-bounds-for-roths-theorem/.
  • [R99] I. Ruzsa, An analog of Freiman's theorem in groups, Structure theory of set addition, Astérisque No. 258 (1999), 323-329. MR 1701207 (2000h:11111)
  • [S08] T. Sanders, A note on Freiman's theorem in vector spaces, Combin. Probab. Comput. 17 (2008), 297-305. MR 2396355 (2009a:11024)
  • [S10] T. Sanders, Structure in Sets with Logarithmic Doubling, Arxiv 1002.1552.
  • [S11] T. Sanders, On Roth's Theorem on Progressions, Arxiv 1011.0104.
  • [Sch11] T. Schoen, Near optimal bounds in Freiman's theorem, Duke Math. J. 158, Number 1 (2011), 1-12. MR 2794366
  • [Shk08] I. Shkredov, On sets of large trigonometric sums, 2008 Izv. Ross. Akad. Nauk Ser. Math. 72, pp. 161-182. MR 2394976 (2009e:11151)
  • [TV06] T. Tao and V. Vu, Additive Combinatorics, Cambridge Univ. Press, Cambridge, 2006. MR 2289012 (2008a:11002)

Similar Articles

Retrieve articles in Journal of the American Mathematical Society with MSC (2010): 11T71, 05D40

Retrieve articles in all journals with MSC (2010): 11T71, 05D40

Additional Information

Michael Bateman
Affiliation: Department of Mathematics, UCLA, Los Angeles, California 90095

Nets Hawk Katz
Affiliation: Department of Mathematics, Indiana University, Bloomington, Indiana 47405-7000

Received by editor(s): April 2, 2011
Received by editor(s) in revised form: October 28, 2011
Published electronically: November 29, 2011
Additional Notes: The first author is supported by an NSF postdoctoral fellowship, DMS-0902490
The second author is partially supported by NSF grant DMS-1001607
Article copyright: © Copyright 2011 American Mathematical Society
The copyright for this article reverts to public domain 28 years after publication.

American Mathematical Society