On exceptional sets in the metric Poissonian pair correlations problem

Let ann\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\left( a_{n}\right) _{n}$$\end{document} be a strictly increasing sequence of positive integers. Recent works uncovered a close connection between the additive energy EAN\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$E\left( A_{N}\right) $$\end{document} of the cut-offs AN=an:n≤N\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$A_{N}=\left\{ a_{n}\,{:}\,\,n\le N\right\} $$\end{document}, and ann\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\left( a_{n}\right) _{n}$$\end{document} possessing metric Poissonian pair correlations which is a metric version of a uniform distribution property of “second order”. Firstly, the present article makes progress on a conjecture of Aichinger, Aistleitner, and Larcher; by sharpening a theorem of Bourgain which states that the set of α∈0,1\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\alpha \in \left[ 0,1\right] $$\end{document} satisfying that αann\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\left( \left\langle \alpha a_{n}\right\rangle \right) _{n}$$\end{document} with EAN=ΩN3\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$E\left( A_{N}\right) =\Omega \left( N^{3}\right) $$\end{document} does not have Poissonian pair correlations has positive Lebesgue measure. Secondly, we construct sequences with high additive energy which do not have metric Poissonian pair correlations, in a strong sense, and provide Hausdorff dimension estimates.


Introduction
The theory of uniform distribution modulo 1 dates back, at least, to the seminal paper [23] of Weyl who showed that for any fixed α ∈ R\Q and integer d ≥ 1 the sequences αn d n are uniformly distributed modulo 1 where x denotes the fractional part of x ∈ R. However, in recent years various authors [2,4,5,9,11,[14][15][16][17][18]21,22] have been investigating a more subtle distribution property of such sequences-namely, whether the asymptotic distribution of the pair correlations has a property which is called Poissonian, and defined as follows.
Definition Let · denote the distance to the nearest integer. A sequence (θ n ) n in [0, 1] is said to have (asymptotically) Poissonian pair correlations, for shorthand notation PPC, if for each s ≥ 0 the pair correlation function 1 tends to 2s as N → ∞. Moreover, let (a n ) n denote a strictly increasing sequence of positive integers. If no confusion can arise, we write It is known that if a sequence (θ n ) n has PPC, then it is uniformly distributed modulo 1, cf. [3,13,19]. Yet, the sequences αn d n do not have PPC for any α ∈ R if d = 1. For d ≥ 2, Rudnick and Sarnak [16] proved that n d n has metric Poissonian pair correlations (metric PPC). A result of Aistleitner et al. [2], who used a Fourier analytic approach combined with a bound on GCD sums of Bondarenko and Seip [6], uncovered the connection of the metric PPC property of (a n ) n with its combinatoric properties. For stating it, we introduce some notation. Let (a n ) n denote throughout this article a strictly increasing sequence of positive integers, and abbreviate the set of the first N elements of (a n ) n by A N . Moreover, define the additive energy E (I ) of a finite set of integers I via E (I ) := # (a, b, c, d) ∈ I 4 : a + b = c + d , and note that (#I ) 2 ≤ E (I ) ≤ (#I ) 3 where #S denotes the cardinality of a set S. In the following, let O and o denote the Landau symbols/O-notation, and or the Vinogradov symbols. The dependence of an implied constant in one of these symbols will be indicated by mentioning this parameter in a subscript. Now, a main finding of [2] can be stated as the implication that if the truncations for some fixed ε > 0, then (a n ) n has metric PPC. Roughly speaking, a set I has large additive energy if and only if it contains a "large" arithmetic progression like structure. Indeed, if (a n ) n is a geometric progression or of the form n d n for d ≥ 2, then (2) is satisfied.
Recently, Bloom, Chow, Gafni, Walker relaxed-provided that, roughly speaking, the density of the sequence does not decay faster than 1/(log N ) 2 -the power saving bound (2) for detecting the metric PPC property of (a n ) n significantly: Theorem A [4] If there exists an ε > 0 such that hold, then (a n ) n has metric PPC.
In accordance with probabilistic considerations, cf. [4, Thm. 1.5], the above result could be seen as a sign of Khintchine-type law underpinning the characterization of the metric PPC property of (a n ) n . Indeed, the following basic question about the nature of the connection between additive energy and the metric PPC property was raised in [4]: Fundamental Question [4] Is it true that if E (A N ) ∼ N 3 ψ (N ) for some weakly decreasing function ψ : N → [0, 1], then (a n ) n has metric PPC if and only if N ≥1 ψ (N ) /N converges? Remark This question will be answered in the negative in a forthcoming note of Aistleitner and the authors.
Regarding the optimal bound for E (A N ) to ensure the metric PPC property of (a n ) n , the following two questions were raised in [2]. For stating those, we use the convention that f = (g) means for f, g : N → R there is a constant c > 0 such that g (n) > c f (n) holds for infinitely many n. Question 1 Is it possible for (a n ) n with E (A N ) = N 3 to have metric PPC?
Both questions were answered in the negative by Bourgain whose proofs can be found in [2] as an appendix, without giving an estimate on the measure of the set that was used to answer Question 1, and without a quantitative bound on E (A N ) appearing in the negation of Question 2. However, a quantitative analysis, as noted in [22], shows that the sequence Bourgain constructed for Question 2 satisfies for any fixed ε > 0. Moreover, Nair posed the problem 2 whether the sequence of prime numbers ( p n ) n , ordered by increasing value, has metric PPC. Recently, Walker [22] answered this question in the negative by showing that there is a constant c > 0 satisfying that for almost every α ∈ [0, 1] the inequality R ([−s, s] , α, N ) > c holds for infinitely many N . Thereby he gave a significantly better bound than (3) for the additive energy E (A n ) for a sequence (a n ) n not having metric PPC-since the additive energy of the truncations of ( p n ) n is in For a given sequence (a n ) n , we denote by NPPC (a n ) n the "exceptional" set of all α ∈ (0, 1) such that ( αa n ) n does not have PPC.
, then NPPC (a n ) n has positive Lebesgue measure.
We prove the following sharpening.
, then NPPC (a n ) n has full Lebesgue measure.
Some remarks are in order.
Remark (a) (a n ) n is called quasi-arithmetic of degree one, cf. [1, Def. 1], if infinitely often at least a constant proportion of elements of A N is contained in some arithmetic progression of length N . Any such sequence obviously satisfies E (A N ) = N 3 . Theorem 1 improves upon a recent result of Aichinger, Aistleitner, and Larcher [1,Thm. 3] who showed that NPPC (a n ) n has full Lebesgue measure, if (a n ) n is quasi-arithmetic of degree one. (b) Recently, Larcher [12,Thm. 1] sharpened this result to NPPC (a n ) n = (0, 1), and subsequently Larcher and Stockinger [10, Thm. 1] extended this to quasiarithmetic sequences of any degree d ≥ 1-which due to Freiman's theorem (cf. [12, text above Def. 2]) implies that if E(A N ) = N 3 , then NPPC (a n ) n = (0, 1).
For stating our second main theorem, we denote by R >x the set of real numbers exceeding a given x ∈ R.
Theorem 2 Let f : R >0 → R >2 be a function increasing monotonically to ∞, and satisfying f (x) = O x 1 /3 (log x) − 7 /3 . Then, there is a strictly increasing sequence (a n ) n of positive integers with E( x ≥ x 0 } is strictly less than 2 for some x 0 > 0, then NPPC (a n ) n has Hausdorff dimension at least denotes the lower order of infinity of f .
We record an immediate consequence of Theorem 2 by using the convention that the r -folded iterated logarithm is denoted by log r (x), i.e.

Corollary 1 Let r be a positive integer. Then, there is a strictly increasing sequence
such that NPPC (a n ) n has full Lebesgue measure. Moreover, for any ε > 0 there is a strictly increasing sequence (a n ) n of positive integers with such that NPPC (a n ) n has full Hausdorff dimension.
The proof of Theorem 2 connects the metric PPC property to the notion of optimal regular systems from Diophantine approximation. It uses, among other things, a Khintchine-type theorem due to Beresnevich. Furthermore, despite leading to better bounds, the nature of the sequences underpinning Theorem 2 is much simpler than the nature of those sequences previously constructed by Bourgain [2] (who used, inter alia, large deviations inequalities from probability theory), or the sequence of prime numbers studied by Walker [22] (who relied on estimates, derived by the circle-method, on the exceptional set in Goldbach-like problems).

First main theorem
Let us give an outline of the proof of Theorem 1. For doing so, we begin by sketching the reasoning of Theorem B: As it turns out, except for a set of negligible measure, the counting function in (1) can be written as a function (of α) that admits a non-trivial estimate for its L 1 -mean value. The mean value is infinitely often too small on sets whose measure is uniformly bounded from below. Thus, there exists a sequence of is too small for every α ∈ r for having PPC and Theorem B follows.
Our reasoning for proving Theorem 1 is building upon this argument of Bourgain while we introduce new ideas to construct a sequence of sets ( r ) r that are "pairwise quasi independent"-meaning that for every fixed t the relation holds as r → ∞ where λ is the Lebesgue measure. Roughly speaking, applying a suitable version of the Borel-Cantelli lemma, combined with a sufficiently careful treatment of the o (1) term, will then yield Theorem 1. However, before proceeding with the details of the proof we collect in the next paragraph some tools from additive combinatorics that are needed.

Preliminaries
We start with a well-know result relating, in a quantitative manner, the additive energy of a set of integers with the existence of a (relatively) dense subset with small difference set where the difference set Moreover, we recall that for δ > 0 and d ∈ Z the set is called Bohr set. The following two simple observations will be useful.
Proof By observing that the set under consideration is contained in the claim follows at once.

Lemma 3 Suppose A is a finite intersection of Bohr sets, and B is a finite union of Bohr sets. Then, A\B is the union of finitely many intervals.
Furthermore, we shall use the Borel-Cantelli lemma in a version due to Erdős, and Rényi.
Moreover, let us explain the main steps in the proof of Theorem 1. Let where c 1 > 0 is a constant to be specified later-on, and j denotes a positive integer.
In the first part of the argument, we show how a sequence-that is constructed in the second part of the argument-can be used to deduce Theorem 1. For every fixed j, we find a corresponding s = s( j) and construct inductively a sequence ( r ) r of exceptional values α with the following properties: (i) For all α ∈ r , the pair correlation function admits the upper bound for some absolute constantc ∈ (0, 1), depending on (a n ) n only. (ii) For all integers r > t ≥ 1, the relation holds. (iii) Each r is the union of finitely many intervals (hence measurable).
(iv) For all r ≥ 1, the measure λ ( r ) is uniformly bounded from below by

Proof of Theorem 1
1. Suppose there is ( r ) r satisfying (i)-(iv). Then, by using (7), we get By recalling that r = r (ε) = r ( j), we let By using the inequality above in combination with Lemma 4 and the bound (8), we obtain that the set ( j) has measure at least Note that due to (6), for every α ∈ ( j) the sequence (αa n ) n does not have PPC. Now, letting j → ∞ proves the assertion.
2. For constructing ( r ) r with the required properties, let c > 0 such that E (A N ) > cN 3 for infinitely many integers N . By choosing an appropriate subsequence (N i ) i and omitting the subscript i for ease of notation, we may suppose that E (A N ) > cN 3 holds for every N occurring in this proof. Moreover, let c 1 , c 2 and B N be as in Lemma 1, corresponding to the c just mentioned. Let Arguing inductively, while postponing the base step, 3 we assume that there are sets ( r ) 1≤r <R given that satisfy the properties (i)-(iv) for all distinct integers 1 ≤ r, t < R. Let N ≥ R. Since, due to Lemma 1, Lemma 2 implies that the set ε,N of all α ∈ [0, 1] satisfying (r − t) α < N −1 s for some distinct r, t ∈ B N has measure at most 2ε. Setting Let R denote the length of the smallest subinterval of r for 1 ≤ r < R, and define C ( r ) to be the set of subintervals of r . Note that R > 0, and max 1≤r <R #C ( r ) < ∞. We divide [0, 1) into parts P i of equal lengths (where x is the integer part of x), i.e.
where i = 0, . . . , P − 1. Let 1 X denote the characteristic function of a Borel set X ⊆ [0, 1]. After writing we split the sum into two parts: one part containing differences |r − t| > R k P, and a second part containing differences |r − t| ≤ R k P where The Cauchy-Schwarz inequality implies Since for any x > 0 there are at most 2x N choices of (r, t) ∈ D N such that |r − t| ≤ x, we obtain Also note that #D N ≤ N 2 − # B N 2 ≤cN 2 wherec := 1 − c 2 1 . Therefore, the mean value (9) of the modified pair correlation counting function on the interval P i admits the upper bound Hence, it follows that the measure of the set N (i) of α ∈ P i with admits, by the choice of k, the lower bound Note that N (i) is the union of finitely many intervals, due to Lemma 3. So, we may take N (i) ⊂ N (i) being a finite union of intervals such that λ N (i) equals the lower bound in (11). Let We are going to show now that R satisfies the properties (i)-(iv). Now, R satisfies property (iv) with r = R since Furthermore, R satisfies property (i) by construction and also property (iii) since all sets involved in the construction of R were a finite union of intervals. Let 1 ≤ r < R, and I be a subinterval of r . Then, By summing over all subintervals I ∈ C ( r ), we obtain that We deduce property (ii) from this estimate and Lemma 2 via This concludes the induction step. The only part missing now is the base step of the induction. For realizing it, let N denote the smallest integer m with E (A m ) > cm 3 . We replace P i in (9) by [0, 1] to directly derive and conclude that the set 1 of α ∈ [0, 1] satisfying (10) has a measure at least c 2 1 /2. Thus, 1 := 1 \ N ,ε has measure at least as large as the right hand side of (8). For property (7), there is nothing to check and that 1 is a finite union of intervals follows from Lemma 3 by observing that where the intersection runs through any set of N 2cs -tuples of differences d i = r i − t i = 0 of components of (r i , t i ) ∈ D N for i = 1, . . . , N 2cs . Thus, the proof is complete.

Second main theorem
The sequences (a n ) n enunciated in Theorem 2 are constructed in two steps. In the first step, we concatenate (finite) blocks, with suitable lengths, of arithmetic progressions to form a set P A . In the second step, we concatenate (finite) blocks, with suitable lengths, of geometric progressions to form a set P G and then define a n to be the n-th smallest element of P A ∪ P G . On the one hand, the arithmetic progression like part P A serves to ensure, due to considerations from metric Diophantine approximation, the divergence property (5) on a set with full measure or controllable Hausdorff dimension; on the other hand, the geometric progression like part P G lowers the additive energy, as much as it can. For doing so, a geometric block will appear exactly before and after an arithmetic block, and have much more elements. For writing the construction precisely down, we introduce some notation. Suppose throughout this section that f is as in Theorem 2. We set P (1) A to be the empty set while P (1) where 0 < γ < β < 3 /4 are parameters 4 to be chosen later-on. Letting we denote by a n the n-th smallest element in P A ∪ P G . For d ∈ Z and finite sets of integers X, Y , we abbreviate the number of representations of d as a difference of an x ∈ X and a y ∈ Y by for later reference, we record here that the additive energy of a set X and the pair correlation counting function can be written as and

Preliminaries
For determining the order of magnitude of E (A N ), the following considerations are useful. Since the cardinality P A has about exponential growth, it is reasonable to expect E (A N ) to be of the same order of magnitude as the additive energy of the last block P A that is fully contained in A N -note that J = J (N ); i.e. to expect the magnitude of E P A . The next proposition verifies this heuristic.

Proposition 1 Let (a n ) n be as in the beginning of Sect. 3, and f be as in one of the two assertions in Theorem 2. Then, E (A
For the proof of Proposition 1, we need the following technical lemma.
j is non-decreasing, we conclude that lim j→∞ f 2 j / f 2 j+1 = 1. Therefore, there is an i 0 such that the estimate holds for any i ≥ i 0 and h ∈ N. Hence, If f is such that (4) converges and f (2x) ≤ (2 − ε) f (x) for x large enough, then we obtain by a similar argument that i≤ j F i is in O F j . Furthermore, rep P ( j) O (i), for every j ≥ 1, and non-vanishing for O 2 2 j values of d which implies the last claim.
We can now prove the proposition.
Proof of Proposition 1 Let N ≥ 1 be large and denote by J = J (N ) ≥ 0 the greatest integer j such that P ( j−1) G ⊆ A N . By exploiting (12), Using that for any a, b ∈ R the inequality (a + b) 2 ≤ 2 a 2 +b 2 holds, we obtain Lemma 5 implies that d∈Z S 2 (d) For estimating the measure or the Hausdorff dimension of NPPC (a n ) n from below, we recall the notion of an optimal regular system. This notion, roughly speaking, describes sequences of real numbers that are exceptionally well distributed in any subinterval, in a uniform sense, of a fixed interval.
Definition Let J be a bounded real interval, and S = (α i ) i a sequence of distinct real numbers. S is called an optimal regular system in J if there exist constants c 1 , c 2 , c 3 > 0-depending on S and J only-such that for any interval I ⊆ J there is an index Q 0 = Q 0 (S, I ) such that for any Q ≥ Q 0 there are indices satisfying α i h ∈ I for h = 1, . . . , t, and Moreover, we need the following result(s) due to Beresnevich which may be thought of as a far reaching generalization of the classical Khintchine theorem, and the Jarník-Besicovitch theorem in Diophantine approximation.
For a rational α = p q , where p, q ∈ Z, q = 0, we denote by H (α) its (naive) height, i.e. H (α) := max {| p| , |q|}. It is well-known that the set of rational numbers in (0, 1)-first running through all rationals of height 1 ordered by increasing numerical value, then through all rationals with height 2 ordered by increasing numerical value, and so on-gives rise to an optimal regular system in (0, 1). The following lemma says, roughly speaking, that this assertion remains true for the set of rationals in (0, 1) whose denominators are members of a special sequence that is not too sparse in the natural numbers, and hand-tailored for our purposes. The proof can be given by modifying the proof of the classical case, compare [7,Prop. 5.3]; however, we shall give the details for making this article more self-contained. Thus, taking c 1 := 1 /1000, c 2 := 2000, and c 3 := 399 4000 in (14)- (16), respectively, S is shown to be an optimal regular system. Now we can proceed to the proof of Theorem 2.

Proof of Theorem 2
We argue in two steps depending on whether or not the series (4) converges. Proposition (1) implies the announced -bounds on the additive energy of A N , in both cases.
(ii) Suppose the series (4) converges. We keep the same sequence as in step (i) while taking ϑ (x) = 1 + log (x), as we may. The arguments of step (i) show that any α ∈ K S (ψ) satisfies (5); now the conclusion is that K S (ψ) has Hausdorff dimension at least equal to the reciprocal of Thus, the proof is complete.

Concluding remarks
It should be possible to relax the growth restriction f (x) = O x 1 /3 (log (x)) − 7 /3 in Theorem 2 on the expense of some additional technical work; as the main objective in this section was to get as close as possible to the Khintchine-type threshold for making progress on the Fundamental Question, we have not expended much effort in possible relaxations.
We would like to mention an open problem related to this article. It asks about how much the PPC property is violated for a sequence that has not metric PPC.
Problem Under which conditions on (a n ) n is it true that NPPC (a n ) n having full Lebesgue measure implies that the set of α ∈