Springer Nature is making SARS-CoV-2 and COVID-19 research free. View research | View latest news | Sign up for updates

Improved bounds for progression-free sets in \(C_8^{n}\)

  • 9 Accesses

Abstract

Let G be a finite group, and let r3(G) represent the size of the largest subset of G without non-trivial three-term progressions. In a recent breakthrough, Croot, Lev and Pach proved that r3(\(C_4^{n}\)) ≤ (3.611)n, where Cm denotes the cyclic group of order m. For finite abelian groups \(G \cong \prod\nolimits_{i = 1}^n {{C_{{m_i}}}} \), where m1,…,mn denote positive integers such that m1 |…|mn, this also yields a bound of the form \(r_3(G)\leqslant(0.903)^{{rk}_4(G)}|G|\), with rk4(G) representing the number of indices i ∈ {1,…, n} with 4 |mi. In particular, r3(\(C_8^{n}\)) ≤ (7.222)n. In this paper, we provide an exponential improvement for this bound, namely r3(\(C_8^{n}\)) ≤ (7.0899)n.

This is a preview of subscription content, log in to check access.

References

  1. [1]

    J. Aaronson, A connection between matchings and removal in abelian groups, https://arxiv.org/abs/1612.04172.

  2. [2]

    M. Bateman and N. H. Katz, New bounds on cap sets, Journal of the American Mathematical Society 25 (2012), 585–613.

  3. [3]

    F. A. Behrend, On sets of integers which contain no three terms in arithmetical progression, Proceedings of the National Academy of Sciences of the United States of America 32 (1946), 331–332.

  4. [4]

    J. Blasiak, T. Church, H. Cohn, J. A. Grochow, E. Naslund, W. F. Sawin and C. Umans, On cap sets and the group-theoretic approach to matrix multiplication, Discrete Analysis (2017), Article no. 3.

  5. [5]

    T. F. Bloom, A quantitative improvement for Roth’s theorem on arithmetic progressions, Journal of the London Mathematical Society 93 (2016), 643–663.

  6. [6]

    E. Croot, V. Lev and P. Pach, Progression-free sets in Zn4are exponentially small, Annals of Mathematics 185 (2017), 331–337.

  7. [7]

    Y. Edel, Extensions of generalized product caps, Designs, Codes and Cryptography 31 (2004), 5–14.

  8. [8]

    J. Ellenberg and D. Gijswijt, On large subsets of Fnqwith no three-term arithmetic progression, Annals of Mathematics 185 (2017), 339–343.

  9. [9]

    C. Elsholtz, Lower bounds for Roth’s theorem in Zn4, preprint.

  10. [10]

    C. Elsholtz and P. Pach, Caps and progression-free sets in Znm, https://arxiv.org/abs/1903.08266.

  11. [11]

    M. Fekete, Über die Verteilung der Wurzeln bei gewissen algebraischen Gleichungen mit ganzzahligen Koeffizienten, Mathematische Zeitschrift 17 (1923), 228–249.

  12. [12]

    R. Kleinberg, W.F. Sawin, D.E. Speyer, The growth rate of tri-colored sum-free sets, preprint at arXiv:1607.00047, 2016.

  13. [13]

    F. Petrov, Combinatorial results implied by many zero divisors in a group ring, https://arxiv.org/abs/1606.03256

  14. [14]

    K. F. Roth, On certain sets of integers, Journal of the London Mathematical Society 28 (1953), 104–109.

  15. [15]

    T. Sanders, Roth’s theorem in Zn4, Analysis & PDE 2 (2009), 211–234.

  16. [16]

    W. Sawin, Bounds for matchings in nonabelian groups, Electronic Journal of Combinatorics 25 (2018), Article no. 4.23.

  17. [17]

    D. Speyer, https://sbseminar.wordpress.com/2016/07/08/bounds-for-sum-free-sets-in-prime-power-cyclic-groups-three-ways/.

Download references

Author information

Correspondence to Cosmin Pohoata.

Additional information

Research supported by Russian Science Foundation grant 17-71-20153.

Rights and permissions

Reprints and Permissions

About this article

Verify currency and authenticity via CrossMark

Cite this article

Petrov, F., Pohoata, C. Improved bounds for progression-free sets in \(C_8^{n}\). Isr. J. Math. (2020). https://doi.org/10.1007/s11856-020-1977-0

Download citation