A new upper bound for sets with no square differences

DOI10.1112/S0010437X22007679MaRDI QIDQ5041007zbMATH OpenOpenAlexFDO

Authors Thomas F. Bloom, James Maynard

Publication date 18 October 2022

Published in Compositio Mathematica (Search for Journal in Brave)

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

zbMATH Keywords

difference setadditive combinatoricsdensity incrementsquares

Mathematics Subject Classification ID

Arithmetic combinatorics; higher degree uniformity (11B30) Quadratic and bilinear Diophantine equations (11D09) Applications of the Hardy-Littlewood method (11P55)

Recommendations

• An improved lower bound related to the Furstenberg-Sárközy theorem
• On representation of r-th powers by subset sums
• On Sets of Natural Numbers Whose Difference Set Contains No Squares
• On sets of natural numbers whose sumset is free of squares
• Multivariate polynomial values in difference sets
• New bounds on cap sets
• Roth's theorem on progressions revisited
• Sumsets avoiding squarefree integers

Cites work

• A maximal extension of the best-known bounds for the Furstenberg-Sárközy theorem
• A polynomial bound in Freiman's theorem.
• An improved lower bound related to the Furstenberg-Sárközy theorem
• Breaking the k ² barrier for explicit RIP matrices
• Difference sets and the primes
• Difference sets without \(\kappa\)-th powers
• Difference sets without squares
• Ergodic behavior of diagonal measures and a theorem of Szemeredi on arithmetic progressions
• Mean and large values of Dirichlet polynomials
• Multiplicative number theory. I. Classical theory
• On Sets of Natural Numbers Whose Difference Set Contains No Squares
• On difference sets of sequences of integers. I
• Simultaneous small fractional parts of polynomials
• Sárközy's theorem in function fields

Cited in

(12)

• An improved lower bound related to the Furstenberg-Sárközy theorem
• On sets of polynomials whose difference set contains no squares
• Additive correlation and the inverse problem for the large sieve
• Binary quadratic forms in difference sets
• A new proof of Sárközy's theorem
• On Sets of Natural Numbers Whose Difference Set Contains No Squares
• Sets in \(\mathbb{Z}_m\) whose difference sets avoid squares
• scientific article; zbMATH DE number 3952888 (Why is no real title available?)
• Bounds in a popular multidimensional nonlinear Roth theorem
• Difference sets and shifted primes
• Sets whose differences avoid squares modulo \(m\)
• Difference sets without squares

This page was built for publication: A new upper bound for sets with no square differences

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