A Generalization of Varnavides's Theorem
Author:
Preprint
Abstract
A linear equation $E$ is said to be sparse if there is $c>0$ so that every subset of $[n]$ of size $n^{1-c}$ contains a solution of $E$ in distinct integers. The problem of characterizing the sparse equations, first raised by Ruzsa in the 90's, is one of the most important open problems in additive combinatorics. We say that $E$ in $k$ variables is abundant if every subset of $[n]$ of size $\varepsilon n$ contains at least poly$(\varepsilon)\cdot n^{k-1}$ solutions of $E$. It is clear that every abundant $E$ is sparse, and Girão, Hurley, Illingworth and Michel asked if the converse implication also holds. In this note we show that this is the case for every $E$ in $4$ variables. We further discuss a generalization of this problem which applies to all linear equations.
Keywords
All Related Versions
This publication has 10 references indexed in Scilit:
- Abundance: Asymmetric graph removal lemmas and integer solutions to linear equationsJournal of the London Mathematical Society, 2024
- Extremal graphs without exponentially small bicliquesDuke Mathematical Journal, 2024
- Strong Bounds for 3-Progressions2023
- Some advances on Sidorenko's conjectureJournal of the London Mathematical Society, 2018
- ROTH’S THEOREM FOR FOUR VARIABLES AND ADDITIVE STRUCTURES IN SUMS OF SPARSE SETSForum of Mathematics, Sigma, 2016
- Translation invariant equations and the method of SandersBulletin of the London Mathematical Society, 2012
- Solving a linear equation in a set of integers IActa Arithmetica, 1993
- Supersaturated graphs and hypergraphsCombinatorica, 1983
- On Certain Sets of Positive DensityJournal of the London Mathematical Society, 1959
- On Sets of Integers Which Contain No Three Terms in Arithmetical ProgressionProceedings of the National Academy of Sciences, 1946