Logarithmic bounds for Roth's theorem via almost-periodicity
From MaRDI portal
Publication:5211003
DOI10.19086/da.7884zbMath1472.11055arXiv1810.12791OpenAlexW2898996103MaRDI QIDQ5211003
Publication date: 17 January 2020
Published in: discrete Analysis (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1810.12791
Arithmetic progressions (11B25) Harmonic analysis and almost periodicity in probabilistic number theory (11K70) Arithmetic combinatorics; higher degree uniformity (11B30)
Related Items (8)
The equidistant dimension of graphs ⋮ The number of \(k\)-dimensional corner-free subsets of grids ⋮ Tower-type bounds for Roth's theorem with popular differences ⋮ A NOTE ON POWERFUL NUMBERS IN SHORT INTERVALS ⋮ Roth's theorem and the Hardy-Littlewood majorant problem for thin subsets of primes ⋮ The Kelley-Meka bounds for sets free of three-term arithmetic progressions ⋮ A subexponential upper bound for van der Waerden numbers \(W(3,k)\) ⋮ Improved bound in Roth's theorem on arithmetic progressions
Cites Work
- Unnamed Item
- On certain other sets of integers
- A probabilistic technique for finding almost-periods of convolutions
- On Roth's theorem on progressions
- Roth's theorem on progressions revisited
- On triples in arithmetic progression
- Integer sets containing no arithmetic progressions
- ROTH’S THEOREM FOR FOUR VARIABLES AND ADDITIVE STRUCTURES IN SUMS OF SPARSE SETS
- New bounds on cap sets
- A quantitative improvement for Roth's theorem on arithmetic progressions: Table 1.
- Additive structures in sumsets
- Integer Sets Containing No Arithmetic Progressions
- Arithmetic Progressions in Sumsets and Lp-Almost-Periodicity
- On Certain Sets of Integers
This page was built for publication: Logarithmic bounds for Roth's theorem via almost-periodicity