Polynomial configurations in difference sets

DOI10.1016/J.JNT.2008.05.003MaRDI QIDQ999722zbMATH OpenOpenAlexFDO

Authors Neil Lyall, Ákos Magyar

Publication date 10 February 2009

Published in Journal of Number Theory (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/0903.4504

zbMATH Keywords

difference setspolynomial configurationsSárközy's theorem

Mathematics Subject Classification ID

Combinatorial aspects of difference sets (number-theoretic, group-theoretic, etc.) (05B10) Arithmetic progressions (11B25) Additive bases, including sumsets (11B13) Inverse problems of additive number theory, including sumsets (11P70)

Abstract: We prove a quantitative version of the Polynomial Szemeredi Theorem for difference sets. This result is achieved by first establishing a higher dimensional analogue of a theorem of Sarkozy (the simplest non-trivial case of the Polynomial Szemeredi Theorem asserting that the difference set of any subset of the integers of positive upper density necessarily contains a perfect square) and then applying a simple lifting argument.

Recommendations

• Arithmetic structure in sparse difference sets
• Polynomial extensions of van der Waerden’s and Szemerédi’s theorems
• Polynomial configurations in subsets of random and pseudo-random sets
• Multivariate polynomial values in difference sets
• A maximal extension of the best-known bounds for the Furstenberg-Sárközy theorem

Cites work

• scientific article; zbMATH DE number 447275 (Why is no real title available?)
• scientific article; zbMATH DE number 699709 (Why is no real title available?)
• scientific article; zbMATH DE number 3088163 (Why is no real title available?)
• A new proof of Szemerédi's theorem
• Difference sets and the primes
• Difference sets without \(\kappa\)-th powers
• Difference sets without squares
• Ergodic behavior of diagonal measures and a theorem of Szemeredi on arithmetic progressions
• Integer Sets Containing No Arithmetic Progressions
• Integer sets containing no arithmetic progressions
• Intersective sets given by a polynomial
• 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. III
• Polynomial extensions of van der Waerden’s and Szemerédi’s theorems
• The Hardy-Littlewood method.

Cited in

(21)

• A Sárközy Theorem for Finite Fields
• On sets of polynomials whose difference set contains no squares
• Polynomial configurations in subsets of random and pseudo-random sets
• Sárközy's theorem in function fields
• Multivariate polynomial values in difference sets
• Binary quadratic forms in difference sets
• Characteristic polynomial patterns in difference sets of matrices
• Arithmetic structure in sparse difference sets
• A new proof of Sárközy's theorem
• A maximal extension of the best-known bounds for the Furstenberg-Sárközy theorem
• Sets of large values of correlation functions for polynomial cubic configurations
• Polynomial configurations in sets of positive upper density over local fields
• Polynomial criterion for abelian difference sets
• scientific article; zbMATH DE number 3952888 (Why is no real title available?)
• Paley graphs and sárközy’s theorem in function fields
• Sárközy's theorem for P-intersective polynomials
• On arithmetic structures in dense sets of integers
• Difference sets and polynomials of prime variables
• Intersective sets given by a polynomial
• Bounds in a popular multidimensional nonlinear Roth theorem
• Sets of large dimension not containing polynomial configurations

This page was built for publication: Polynomial configurations in difference sets

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q999722)