A new proof of Sárközy's theorem

DOI10.1090/S0002-9939-2013-11628-XMaRDI QIDQ2839296zbMATH OpenOpenAlexFDO

Authors Neil Lyall

Publication date 5 July 2013

Published in Proceedings of the American Mathematical Society (Search for Journal in Brave)

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

zbMATH Keywords

difference setsSárközy's theorem

Mathematics Subject Classification ID

Combinatorial aspects of difference sets (number-theoretic, group-theoretic, etc.) (05B10) Arithmetic combinatorics; higher degree uniformity (11B30) Density, gaps, topology (11B05)

Abstract: It is a striking and elegant fact (proved independently by Furstenberg and Sarkozy) that in any subset of the natural numbers of positive upper density there necessarily exist two distinct elements whose difference is given by a perfect square. In this article we present a new and simple proof of this result by adapting an argument originally developed by Croot and Sisask to give a new proof of Roth's theorem.

Recommendations

• scientific article; zbMATH DE number 3952888
• Sárközy's theorem for P-intersective polynomials
• An improved lower bound related to the Furstenberg-Sárközy theorem
• A new upper bound for sets with no square differences
• On Sets of Natural Numbers Whose Difference Set Contains No Squares

Cites work

• scientific article; zbMATH DE number 699709 (Why is no real title available?)
• scientific article; zbMATH DE number 850027 (Why is no real title available?)
• A new proof of Roth’s theorem on arithmetic progressions
• A new proof of Sárközy's theorem
• Arithmetic structures in random sets
• 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 Positive Density
• 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 configurations in difference sets
• Van der Corput's difference theorem

Cited in

(12)

• On a theorem of Sárközy for difference sets and shifted primes
• scientific article; zbMATH DE number 1375610 (Why is no real title available?)
• A new proof of Szemerédi's theorem
• An improved lower bound related to the Furstenberg-Sárközy theorem
• Problems and Results on Intersective Sets
• A maximal extension of the best-known bounds for the Furstenberg-Sárközy theorem
• scientific article; zbMATH DE number 3952888 (Why is no real title available?)
• A new proof of Sárközy's theorem
• Threshold functions and Poisson convergence for systems of equations in random sets
• Multivariate polynomial values in difference sets
• A new proof of the McKinsey-Tarski theorem
• Binary quadratic forms in difference sets

This page was built for publication: A new proof of Sárközy's theorem

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