Multivariate polynomial values in difference sets
From MaRDI portal
Abstract: For and of degree , we show that every set lacking nonzero differences in satisfies , where , if , and if , provided contains a multiple of every natural number and satisfies certain nonsingularity conditions. We also explore these conditions in detail, drawing on a variety of tools from algebraic geometry.
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
- A polynomial Sárközy-Furstenberg theorem with upper bounds
- An improved lower bound related to the Furstenberg-Sárközy 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
- Diophantine equations in the primes
- Ergodic behavior of diagonal measures and a theorem of Szemeredi on arithmetic progressions
- Forms in many variables
- scientific article; zbMATH DE number 3859276 (Why is no real title available?)
- scientific article; zbMATH DE number 3572315 (Why is no real title available?)
- scientific article; zbMATH DE number 3582248 (Why is no real title available?)
- scientific article; zbMATH DE number 1466163 (Why is no real title available?)
- Improved Bounds on Sárközy’s Theorem for Quadratic Polynomials
- Intersective sets given by a polynomial
- Number of Points of Varieties in Finite Fields
- On a theorem of Sárközy for difference sets and shifted primes
- On arithmetic structures in dense sets of integers
- 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
- Polynomial configurations in difference sets
- Polynomials and Primes in Generalized Arithmetic Progressions
- Sárközy's theorem for P-intersective polynomials
- The Hardy-Littlewood method.
- Théoremes de Bertini et applications
- Van der Corput's difference theorem
Cited in
(10)- Additive properties for sets of polynomial values
- On sets of polynomials whose difference set contains no squares
- Sárközy's theorem for P-intersective polynomials
- Binary quadratic forms in difference sets
- A maximal extension of the best-known bounds for the Furstenberg-Sárközy theorem
- A new upper bound for sets with no square differences
- The Furstenberg-Sárközy theorem for polynomials in one or more prime variables
- A maximal extension of the Bloom-Maynard bound for sets without square differences
- Notes and computations on forbidden differences
- Polynomial configurations in difference sets
This page was built for publication: Multivariate polynomial values in difference sets
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3382246)