Intersective sets for sparse sets of integers
This paper continues the investigation of the extent to which results in combinatorial number theory asserting that (for example) sets of positive density in the natural numbers contain various arithmetic structures to sets of positive density relative to (that is, within) a given `sparse' set. The most significant development in this direction is the theorem of \textit{B. Green} and \textit{T. Tao} [Ann. Math. (2) 167, No. 2, 481--547 (2008; Zbl 1191.11025)]: A dense subset of the primes must contain arbitrarily long arithmetic progressions. The focus here is on `intersective' properties: Given an infinite set \(E\subset\mathbb{N}\) a set~\(R\subset E\) is called \(E\)-intersective if any subset \(A\subset E\) with \(\overline{d}_E(A)=\limsup_{n\to\infty}\vert A\cap E\cap\{1,\dots,n\}\vert/\vert E\cap\{1,\dots,n\}\vert>0\) has \(R\cap(A-A)\neq\varnothing\) (in ergodic theory this is also called `a set of recurrence'). \textit{A. Sarközy} [Acta Math. Acad. Sci. Hung. 31, 125--149 (1978; Zbl 0387.10033)] (using the circle method) and \textit{H. Furstenberg} [J. Anal. Math. 31, 204--256 (1977; Zbl 0347.28016)] (using transference to ergodic theory) showed that \(\{n^2\mid n\in\mathbb{N}\}\) is intersective, and later results included finding general modular conditions under which the range of more general polynomials evaluated on \(\mathbb{N}\) or on the primes \(\mathbb{P}\) is intersective by \textit{T. Kamae} and \textit{M. Mendès France} [Isr. J. Math. 31, 335--342 (1978; Zbl 0396.10040)] and further results of \textit{A. Sarközy} [Acta Math. Acad. Sci. Hung. 31, 355--386 (1978; Zbl 0387.10034)] showing that \(\{n^2-1\mid n>1\}\) and \(\mathbb{P}\pm1\) are intersective. The work here adds to the collection of sets known to be both intersective and prime intersective (that is, intersective relative to the primes). A prime \(p\) is called a `Chen prime' and said to be in \(\mathbb{P}_{\text{Chen}}\) if \(p+2\) is a product of at most two primes, and the first theorem here is that \(\mathbb{P}_{\text{Chen}}+1\) is intersective and prime intersective. It is also shown that there exist thick (and hence intersective) sets that are not prime intersective, and more technical results in this direction are found. Finally it is shown that for any infinite set \(E\subset\mathbb{N}\), every \(E\)-intersective set is intersective. Other results compare colouristic and density results connected to the intersective property. The approach uses results from number theory as well as novel transference ideas and results that allow ergodic methods to be brought to bear.
- A maximal extension of the best-known bounds for the Furstenberg-Sárközy theorem
- A Transference Approach to a Roth-Type Theorem in the Squares
- A transference principle for systems of linear equations, and applications to almost twin primes
- An interesting combinatorial method in the theory of locally finite semigroups
- Aspects of uniformity in recurrence
- Bohr sets in sumsets II: countable abelian groups
- Bounded gaps between primes
- Bounded gaps between primes in Chebotarev sets
- Chebotarëv and his density theorem
- Dense clusters of primes in subsets
- Difference sets and polynomials of prime variables
- Ensembles intersectifs et récurrence de Poincaré. (Intersective sets and Poincaré recurrence)
- Ergodic behavior of diagonal measures and a theorem of Szemeredi on arithmetic progressions
- Fourier analysis on groups.
- Hilbert’s Proof of His Irreducibility Theorem
- scientific article; zbMATH DE number 3719449 (Why is no real title available?)
- scientific article; zbMATH DE number 3467229 (Why is no real title available?)
- scientific article; zbMATH DE number 3593674 (Why is no real title available?)
- Intersective polynomials and the primes
- Lacunarity and the Bohr topology
- Large independent sets in shift-invariant graphs
- Linear correlations amongst numbers represented by positive definite binary quadratic forms
- Linear equations in primes
- Metric decomposability theorems on sets of integers
- On a conjecture of Cusick concerning the sum of digits of n and n+t
- On difference sets of sequences of integers. I
- On difference sets of sequences of integers. III
- On Monothetic Groups
- On Non-Averaging Sets of Integers
- On polynomials in primes and J. Bourgain's circle method approach to ergodic theorems II
- On sets of integers containing k elements in arithmetic progression
- On the set of the difference of primes
- Poincaré recurrence and number theory
- Pointwise ergodic theorem along the prime numbers
- Pointwise ergodic theorems for arithmetic sets. With an appendix on return-time sequences, jointly with Harry Furstenberg, Yitzhak Katznelson and Donald S. Ornstein
- Polignac numbers, conjectures of Erdős on gaps between primes, arithmetic progressions in primes, and the bounded gap conjecture
- Polynomial extensions of van der Waerden’s and Szemerédi’s theorems
- Problems and Results on Intersective Sets
- Roth's theorem in the primes
- Sets of Recurrence of Zm -Actions and Properties of Sets of Differences in Zm
- Small gaps between primes
- Sumsets of dense sets and sparse sets
- Sárközy's theorem for P-intersective polynomials
- The existence of small prime gaps in subsets of the integers
- The Haar measure of certain sets in the Bohr group
- The polynomial multidimensional Szemerédi theorem along shifted primes
- The primes contain arbitrarily long arithmetic progressions
- Van der Corput's difference theorem
This page was built for publication: Intersective sets for sparse sets of integers
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6999438)
