Logarithmic bounds for Roth's theorem via almost-periodicity

DOI10.19086/DA.7884MaRDI QIDQ5211003zbMATH OpenOpenAlexFDO

Authors Thomas F. Bloom, Olof Sisask

Publication date 17 January 2020

Published in discrete Analysis (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://arxiv.org/abs/1810.12791

zbMATH Keywords

new proof of logarithmic boundsRoth's theorem on arithmetic progressions

Mathematics Subject Classification ID

Arithmetic progressions (11B25) Arithmetic combinatorics; higher degree uniformity (11B30) Harmonic analysis and almost periodicity in probabilistic number theory (11K70)

Abstract: We give a new proof of logarithmic bounds for Roth's theorem on arithmetic progressions, namely that if $Asubset1,2,ldots,N$ is free of three-term progressions, then $lvertAvertleqN/(logN{)}^{1-o(1)}$. Unlike previous proofs, this is almost entirely done in physical space using almost-periodicity.

Recommendations

• A Polylogarithmic Bound in the Nonlinear Roth Theorem
• scientific article; zbMATH DE number 4085746
• Towards boundedness of minimal log discrepancies by the Riemann-Roch theorem
• Roth's theorem on progressions revisited
• scientific article; zbMATH DE number 1244281
• A new interpretation of Gottschalk's results on almost periodicity
• scientific article; zbMATH DE number 892532
• Publication:3474718
• A generalization of Sándor's theorem using iterated logarithms
• A generalization of a theorem of Rothschild and van Lint

Cites work

• A probabilistic technique for finding almost-periods of convolutions
• A quantitative improvement for Roth's theorem on arithmetic progressions: Table 1.
• Additive combinatorics
• Additive structures in sumsets
• Arithmetic progressions in sumsets and \(L^p\)-almost-periodicity
• Integer sets containing no arithmetic progressions
• Integer Sets Containing No Arithmetic Progressions
• New bounds on cap sets
• On certain other sets of integers
• On Certain Sets of Integers
• On Roth's theorem on progressions
• On triples in arithmetic progression
• Roth's theorem for four variables and additive structures in sums of sparse sets
• Roth's theorem on progressions revisited

Cited in

(16)

• A subexponential upper bound for van der Waerden numbers \(W(3,k)\)
• Improved bound in Roth's theorem on arithmetic progressions
• The equidistant dimension of graphs
• The number of k-dimensional corner-free subsets of grids
• Construction of strongly aperiodic logarithmic signatures
• Three-term arithmetic progressions and sumsets
• New bounds for Szemerédi's theorem, I: progressions of length 4 in finite field geometries
• A new proof of Roth’s theorem on arithmetic progressions
• A characteristic factor for the 3-term IP Roth theorem in \(\mathbb{Z}_3^\mathbb{N}\)
• A Polylogarithmic Bound in the Nonlinear Roth Theorem
• On a problem of Gowers
• scientific article; zbMATH DE number 5219601 (Why is no real title available?)
• 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

This page was built for publication: Logarithmic bounds for Roth's theorem via almost-periodicity

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5211003)