On arithmetic structures in dense sets of integers
The main aim of the paper is to prove the result that if \(A\subset\{1,2,\dots,N\}\) has density at least \((\log\log N)^{-c}\), where \(c\) is an absolute constant, then \(A\) contains a \(3\)-term arithmetic progression whose common difference is positive and of the form \(x^2+y^2\) for some integers \(x,y\) not both zero. The proof method is based on ideas developed by Gowers and Sárközy combined with an application of the Selberg sieve. Using a new variant of Sárközy's proof, the author also shows that there is a constant \(c\) such that, if \(A\subset\{1,2,\dots,N\}\) has density at least \(c(\log\log N)^{-1/11}\), then \(A\) contains two elements \(a,a^\prime\) with \(a-a^\prime\) a nonzero square.
- A new proof of Szemerédi's theorem
- A new proof of Szemerédi's theorem for arithmetic progressions of length four
- Difference sets without squares
- Elementary methods in number theory
- Ergodic behavior of diagonal measures and a theorem of Szemeredi on arithmetic progressions
- scientific article; zbMATH DE number 3952888 (Why is no real title available?)
- scientific article; zbMATH DE number 3467229 (Why is no real title available?)
- scientific article; zbMATH DE number 699709 (Why is no real title available?)
- On Certain Sets of Integers
- On difference sets of sequences of integers. I
- On difference sets of sequences of integers. III
- On sets of integers containing k elements in arithmetic progression
- On Sets of Natural Numbers Whose Difference Set Contains No Squares
- Polynomial extensions of van der Waerden’s and Szemerédi’s theorems
- Rado's criterion over squares and higher powers
- On sumsets of subsets of squares
- Generations of correlation averages
- A multi-dimensional Szemerédi theorem for the primes via a correspondence principle
- Polynomial configurations in subsets of random and pseudo-random sets
- A new proof of Sárközy's theorem
- On a diagonal quadric in dense variables
- DENSE SETS OF INTEGERS WITH A PRESCRIBED REPRESENTATION FUNCTION
- Sárközy's theorem for P-intersective polynomials
- Arithmetic progressions with a pseudorandom step
- Binary quadratic forms in difference sets
- scientific article; zbMATH DE number 3880822 (Why is no real title available?)
- Multivariate polynomial values in difference sets
- On the structure of steps of three-term arithmetic progressions in a dense set of integers
- Additive structures in sumsets
- Structure along arithmetic patterns in sequences of vectors
- scientific article; zbMATH DE number 1786782 (Why is no real title available?)
- A maximal extension of the best-known bounds for the Furstenberg-Sárközy theorem
- Quantitative bounds in the polynomial Szemerédi theorem: the homogeneous case
- A general nonlinear version of Roth's theorem on the real line
- Popular progression differences in vector spaces II
- Asymptotics for some polynomial patterns in the primes
- Problems and Results on Intersective Sets
- A note on additive properties of dense subsets of sifted sequences
- scientific article; zbMATH DE number 7332477 (Why is no real title available?)
- Counting configuration-free sets in groups
- Tower-type bounds for Roth's theorem with popular differences
- Quantitative concatenation for polynomial box norms
- The Furstenberg-Sárközy theorem for polynomials in one or more prime variables
- The primes contain arbitrarily long polynomial progressions
- John-type theorems for generalized arithmetic progressions and iterated sumsets
- Difference sets and shifted primes
- Arithmetic structure in sparse difference sets
- Polynomial configurations in difference sets
This page was built for publication: On arithmetic structures in dense sets of integers
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1847946)
