Notes and computations on forbidden differences
From MaRDI portal
Cites work
- A maximal extension of the best-known bounds for the Furstenberg-Sárközy theorem
- A maximal extension of the Bloom-Maynard bound for sets without square differences
- A new upper bound for sets with no square differences
- A polynomial Sárközy-Furstenberg theorem with upper bounds
- An improved branch and bound algorithm for the maximum clique problem
- An improved lower bound related to the Furstenberg-Sárközy theorem
- Binary quadratic forms in difference sets
- 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
- Multivariate polynomial values in difference sets
- On a theorem of Sárközy for difference sets and shifted primes
- On difference sets of sequences of integers. I
- On difference sets of sequences of integers. III
- On measures of intersectivity
- On Sets of Natural Numbers Whose Difference Set Contains No Squares
- On Sárközy's theorem for shifted primes
- Sequences of integers with missing differences
- Sets of integers with missing differences
- Sets of integers with missing differences
- Sárközy's theorem for P-intersective polynomials
- The Furstenberg-Sárközy theorem for polynomials in one or more prime variables
- Two Erdős problems on lacunary sequences: chromatic number and Diophantine approximation
- Van der Corput's difference theorem
This page was built for publication: Notes and computations on forbidden differences
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7363993)
