English

On a Ramsey--Tur\'{a}n variant of Roth's theorem

Combinatorics 2025-07-31 v1

Abstract

A classical theorem of Roth states that the maximum size of a solution-free set of a homogeneous linear equation L\mathcal{L} in Fp\mathbb{F}_p is o(p)o(p) if and only if the sum of the coefficients of L\mathcal{L} is 00. In this paper, we prove a Ramsey--Tur\'{a}n variant of Roth's theorem, with respect to a natural notion of ``structured'' sets introduced by Erd\H{o}s and S\'ark\"ozy in the 1970's. Namely, we show that the following statements are equivalent: (a)(a) Every solution-free set AA of L\mathcal{L} in Fp\mathbb{F}_p with α(CayFp(A))=o(p)\alpha(\mathrm{Cay}_{\mathbb{F}_p}(A)) = o(p) has size o(p)o(p). (b)(b) There exists a non-empty \emph{subset} of coefficients of L\mathcal{L} with zero sum.

Keywords

Cite

@article{arxiv.2507.22831,
  title  = {On a Ramsey--Tur\'{a}n variant of Roth's theorem},
  author = {Matija Bucić and Micha Christoph and Jaehoon Kim and Hyunwoo Lee and Varun Sivashankar},
  journal= {arXiv preprint arXiv:2507.22831},
  year   = {2025}
}

Comments

16 pages