A new upper bound for sets with no square differences
From MaRDI portal
Publication:5041007
DOI10.1112/S0010437X22007679OpenAlexW3109240484MaRDI QIDQ5041007FDOQ5041007
James Maynard, Thomas F. Bloom
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
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
- An improved construction of progression-free sets
- An improved construction of progression-free sets
- 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
Arithmetic combinatorics; higher degree uniformity (11B30) Quadratic and bilinear Diophantine equations (11D09) Applications of the Hardy-Littlewood method (11P55)
Cites Work
- Ergodic behavior of diagonal measures and a theorem of Szemeredi on arithmetic progressions
- Multiplicative number theory. I. Classical theory
- On difference sets of sequences of integers. I
- Difference sets without \(\kappa\)-th powers
- On Sets of Natural Numbers Whose Difference Set Contains No Squares
- Difference sets without squares
- Breaking the k 2 barrier for explicit RIP matrices
- A polynomial bound in Freiman's theorem.
- Mean and large values of Dirichlet polynomials
- An improved lower bound related to the Furstenberg-Sárközy theorem
- A maximal extension of the best-known bounds for the Furstenberg–Sárközy theorem
- Difference sets and the primes
- Sárközy's Theorem in Function Fields
- Simultaneous small fractional parts of polynomials
Cited In (5)
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)
