Polynomial configurations in difference sets

DOI10.1016/J.JNT.2008.05.003zbMATH Open1228.11015arXiv0903.4504OpenAlexW2028158253MaRDI QIDQ999722FDOQ999722

Authors: Neil Lyall, Ákos Magyar 

Publication date: 10 February 2009

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

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.

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

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

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)

Cites Work

• Title not available (Why is that?)
• Ergodic behavior of diagonal measures and a theorem of Szemeredi on arithmetic progressions
• The Hardy-Littlewood method.
• Title not available (Why is that?)
• Polynomial extensions of van der Waerden’s and Szemerédi’s theorems
• Title not available (Why is that?)
• A new proof of Szemerédi's theorem
• Difference sets without \(\kappa\)-th powers
• On arithmetic structures in dense sets of integers
• On Sets of Natural Numbers Whose Difference Set Contains No Squares
• Difference sets without squares
• Integer sets containing no arithmetic progressions
• Integer Sets Containing No Arithmetic Progressions
• On difference sets of sequences of integers. III
• Intersective sets given by a polynomial
• Difference sets and the primes

Cited In (16)

• Polynomial criterion for abelian difference sets
• Polynomial configurations in sets of positive upper density over local fields
• Multivariate Polynomial Values in Difference Sets
• Arithmetic structure in sparse difference sets
• Binary Quadratic Forms in Difference Sets
• A Sárközy Theorem for Finite Fields
• Sárközy's theorem for P-intersective polynomials
• On arithmetic structures in dense sets of integers
• Intersective sets given by a polynomial
• Paley graphs and sárközy’s theorem in function fields
• Sets of large dimension not containing polynomial configurations
• Title not available (Why is that?)
• Bounds in a popular multidimensional nonlinear Roth theorem
• A new proof of Sárközy's theorem
• Difference sets and polynomials of prime variables
• A maximal extension of the best-known bounds for the Furstenberg–Sárközy theorem

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)