Improved Bounds on Sárközy’s Theorem for Quadratic Polynomials
From MaRDI portal
Publication:5250684
DOI10.1093/IMRN/RNS106zbMATH Open1337.11006arXiv1111.5786OpenAlexW2962854175MaRDI QIDQ5250684FDOQ5250684
Authors: Mariah Hamel, Neil Lyall, Alex Rice
Publication date: 22 May 2015
Published in: IMRN. International Mathematics Research Notices (Search for Journal in Brave)
Abstract: We extend the best known bound on the largest subset of {1,2,...,N} with no square differences to the largest possible class of quadratic polynomials.
Full work available at URL: https://arxiv.org/abs/1111.5786
Trigonometric and exponential sums (general theory) (11L03) Arithmetic combinatorics; higher degree uniformity (11B30)
Cited In (8)
- An improvement of the Minkowski bound for real quadratic orders using the Markoff theorem
- Polynomial configurations in subsets of random and pseudo-random sets
- A maximal extension of the best-known bounds for the Furstenberg-Sárközy theorem
- A new proof of Sárközy's theorem
- The Pintz-Steiger-Szemerédi estimate for intersective quadratic polynomials in function fields
- Multivariate polynomial values in difference sets
- Binary quadratic forms in difference sets
- A polynomial Sárközy-Furstenberg theorem with upper bounds
This page was built for publication: Improved Bounds on Sárközy’s Theorem for Quadratic Polynomials
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5250684)