Binary quadratic forms in difference sets
From MaRDI portal
Publication:3296100
Abstract: We show that if satisfies , then any subset of lacking nonzero differences in the image of has size at most a constant depending on times , where . We achieve this goal by adapting an density increment strategy previously used to establish analogous results for sums of one or more single-variable polynomials. Our exposition is thorough and self-contained, in order to serve as an accessible gateway for readers who are unfamiliar with previous implementations of these techniques.
Recommendations
Cites work
- A maximal extension of the best-known bounds for the Furstenberg-Sárközy theorem
- A new proof of Sárközy's theorem
- Difference sets and polynomials of prime variables
- Difference sets and shifted primes
- Difference sets and the primes
- Difference sets without -th powers
- Difference sets without squares
- Ergodic behavior of diagonal measures and a theorem of Szemeredi on arithmetic progressions
- Improved Bounds on Sárközy’s Theorem for Quadratic Polynomials
- Intersective sets given by a polynomial
- On Certain Sets of Integers
- On Sets of Natural Numbers Whose Difference Set Contains No Squares
- On arithmetic structures in dense sets of integers
- On difference sets of sequences of integers. I
- On difference sets of sequences of integers. III
- Polynomial configurations in difference sets
- Sárközy's theorem for P-intersective polynomials
- Van der Corput's difference theorem
Cited in
(2)
This page was built for publication: Binary quadratic forms in difference sets
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3296100)