Published March 2020
| Submitted
Journal Article
Open
Improved Bounds for Progression-Free Sets in C^n₈
- Creators
- Petrov, Fedor
- Pohoata, Cosmin
Abstract
Let G be a finite group, and let r₃(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 r₃(C₄^n) ≤ (3.611)^n, where C_m denotes the cyclic group of order m. For finite abelian groups G≅∏^n_(i=1), where m₁,…,m_n denote positive integers such that m₁ |…|m_n, this also yields a bound of the form r₃(G)⩽(0.903)^(rk₄(G))|G|, with rk₄(G) representing the number of indices i ∈ {1,…, n} with 4 |m_i. In particular, r₃(Cn₈) ≤ (7.222)^n. In this paper, we provide an exponential improvement for this bound, namely r₃(Cn₈) ≤ (7.0899)^n.
Additional Information
© 2020 The Hebrew University of Jerusalem. First Online: 12 February 2020. Research supported by Russian Science Foundation grant 17-71-20153.Attached Files
Submitted - 1805.05549.pdf
Files
1805.05549.pdf
Files
(197.8 kB)
Name | Size | Download all |
---|---|---|
md5:5d0d2287094f6332cf8007ab1970664c
|
197.8 kB | Preview Download |
Additional details
- Eprint ID
- 100648
- DOI
- 10.1007/s11856-020-1977-0
- Resolver ID
- CaltechAUTHORS:20200110-155400957
- 17-71-20153
- Russian Science Foundation
- Created
-
2020-01-11Created from EPrint's datestamp field
- Updated
-
2021-11-16Created from EPrint's last_modified field