Improved Bounds for Progression-Free Sets in C8n

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(C4n) ≤slant (3.61)n, where Cm denotes the cyclic group of order m. For finite abelian groups G Πi=1n Cmi, where m1,…,mn denote positive integers such that m1 | … | mn, this also yields a bound of the form r3(G) ≤slant (0.903)rk4(G) |G|, with rk4(G) representing the number of indices i ∈ \1,…,n\ with 4\ |\ mi. In particular, r3(C8n) ≤slant (7.22)n. In this paper, we provide an exponential improvement for this bound, namely r3(C8n) ≤ (7.09)n.

0

Turn this paper into a lesson

ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…