Investigates a variant of Roth's theorem on structured sets, suggesting significant implications for combinatorial mathematics.
A classical theorem of Roth states that the maximum size of a solution‐free set of a homogeneous linear equation in is if and only if the sum of the coefficients of is 0. In this paper, we prove a Ramsey–Turán variant of Roth's theorem, with respect to a natural notion of “structured” sets introduced by Erdős and Sárközy in the 1970s. Namely, we show that the following statements are equivalent: Every solution‐free set of in with has size . There exists a non‐empty subset of coefficients of with zero sum.
No takes yet. Share an insight, caveat, or question.
Bucić et al. (2026) studied this question.
Synapse has enriched 5 closely related papers on similar clinical questions. Consider them for comparative context: