DOI

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) ≤ (3.611)n, where Cm denotes the cyclic group of order m. For finite abelian groups G≅∏i=1nCmi, where m1,…,mn denote positive integers such that m1 |…|mn, this also yields a bound of the form r3(G)⩽(0.903)rk4(G)|G|, with rk4(G) representing the number of indices i ∈ {1,…, n} with 4 |mi. In particular, r3(C8n) ≤ (7.222)n. In this paper, we provide an exponential improvement for this bound, namely r3(C8n) ≤ (7.0899)n.

Язык оригиналаанглийский
Страницы (с-по)345-363
Число страниц19
ЖурналIsrael Journal of Mathematics
Том236
Номер выпуска1
DOI
СостояниеОпубликовано - 1 мар 2020

    Предметные области Scopus

  • Математика (все)

ID: 75248024