On a multi-dimensional Poissonian pair correlation concept and uniform distribution

The aim of the present article is to introduce a concept which allows to generalise the notion of Poissonian pair correlation, a second-order equidistribution property, to higher dimensions. Roughly speaking, in the one-dimensional setting, the pair correlation statistics measures the distribution of spacings between sequence elements in the unit interval at distances of order of the mean spacing 1 / N. In the d-dimensional case, of course, the order of the mean spacing is 1/N1d\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$1/N^{\frac{1}{d}}$$\end{document}, and—in our concept—the distance of sequence elements will be measured by the supremum-norm. Additionally, we show that, in some sense, almost all sequences satisfy this new concept and we examine the link to uniform distribution. The metrical pair correlation theory is investigated and it is proven that a class of typical low-discrepancy sequences in the high-dimensional unit cube do not have Poissonian pair correlations, which fits the existing results in the one-dimensional case.


Introduction and statement of results
The concept of Poissonian pair correlations has its origin in quantum mechanics, where the spacings of energy levels of integrable systems were studied. See for example [1] and the references cited therein for detailed information on that topic. Rudnick and Sarnak first studied this concept from a purely mathematical point of view and over the years the topic has attracted wide attention, see e.g., [12,[17][18][19][20]. Let · denote the distance to the nearest integer. A sequence (x n ) n∈N of real numbers in [0, 1) has Poissonian pair correlations if the pair correlation statistics tends to 2s, for every s ≥ 0, as N → ∞. Let now d ≥ 2 be an integer denoting the dimension of the problem setting. In the sequel, we indicate by bold symbols that we work with d-dimensional vectors of real numbers or random variables. We extend the above notion to sequences (x n ) n∈N in the d-dimensional unit cube [0, 1) d . Subsequently, we denote by · ∞ a supremum-norm of a d-dimensional vector, i.e., in our case for some x = (x 1 , . . . , x d ) ∈ R d , where we recall that · denotes the distance to the nearest integer.
We say that a sequence (x n ) n∈N ∈ [0, 1) d has Poissonian pair correlations if the multi-dimensional pair correlation statistics In the one-dimensional case, it is well-known that for a sequence of i.i.d. random variables (X i ) i∈N having uniform distribution on [0, 1), F N (s) tends to 2s, as N → ∞, almost surely (see e.g., [2,16]). Clearly, a multi-dimensional analogue of this statement holds as well. The proof is based on the pairwise independence of the random variables X l − X m , l = m, and the Borel-Cantelli lemma. For completeness, we state the proof in Sect. 2. Note that, however, this result would be true if the " ∞ -ball" in the definition of the pair correlation is replaced by an arbitrary measurable set of volume (2s) d /N . The notion of Poissonian pair correlation has attracted renewed interest in the last few years, due to its connection to several mathematical fields, such as Diophantine approximation, additive combinatorics and uniform distribution (see e.g., [1,3,4,12,14,22]). The link between the concept of uniform distribution modulo 1 and Poissonian pair correlation has been studied in the one-dimensional case. Due to a result by Grepstad and Larcher [11] (see also [2,21]), we know that a sequence which satisfies that (1) tends to 2s, for every s > 0, as N → ∞, is also uniformly distributed in [0, 1), i.e., it satisfies The above presented multi-dimensional concept of Poissonian pair correlation also implies uniform distribution of a sequence in [0, 1) d , i.e., It turns out by the proof of this theorem that it is sufficient to have the Poissonian property for positive integer-valued s only in order to deduce uniform distribution for a sequence (x n ) n∈N ∈ [0, 1) d (the same holds in the one-dimensional case as well). It would be very interesting if this result also holds if we define the multidimensional pair correlation concept using other norms, e.g., the L 2 -norm. However, it is not straightforward how one could prove such a result. The main difficulty here is the following: we can pave the unit-cube with a suitable choice of boxes of volume 1/N when we work with the supremum-norm. Such a partitioning is not possible, when using the L 2 -norm. This new concept of course raises several further questions. E.g., in the onedimensional case, it is known that for almost all choices of α the sequence is a polynomial of degree at least 2 with integer coefficients, has Poissonian pair correlations [18].
are all real polynomials) has the property that for each lattice point h ∈ Z d , h = 0 the polynomial h, p(x) has at least one non-constant term with irrational coefficient, then is uniformly distributed in [0, 1) d (see e.g., [13]). Therefore, in analogy to the onedimensional case, it would be natural to expect that for an integer polynomial f (x) with degree at least 2, the sequence has Poissonian pair correlation for almost all choices of α 1 , . . . , α d (this claim will be a consequence of Theorem 2).
To be more general, let (a n ) n∈N be an increasing sequence of distinct integers and α = (α 1 , . . . , α d ). Then we consider a sequence of the form which is uniformly distributed for almost all choices of α 1 , . . . , α d .
In the one-dimensional case the metrical pair correlation theory of such sequences is strongly linked to the additive energy of a finite integer set A, denoted by E(A). The additive energy E(A) is defined as where the sum is extended over all quadruples (a, b, c, d) ∈ A 4 . This connection was discovered by Aistleitner, Larcher and Lewko, who, roughly speaking, proved in [4] that if the first N elements of an increasing sequence of distinct integers (a n ) n∈N , have an arbitrarily small energy saving, then ({a n α}) n∈N has Poissonian pair correlations for almost all α. Recently, Bloom and Walker (see [5]) improved over this result by showing the following theorem.
Theorem A There exists an absolute positive constant C such that the following is true. Let A N denote the first N elements of (a n ) n∈N and suppose that then for almost all α, ({a n α}) n∈N has Poissonian pair correlations.
The proof of this result relies on a new bound for GCD sums with exponent 1/2, which improves over the bound by Bondarenko and Seip (see [6]), if the additive energy of A N is sufficiently large. Note that the constant C was not specified in the above mentioned paper, but the authors thereof conjecture that Theorem A holds for C > 1 already. This result would be best possible. To see this, consider the sequence ( p n ) n∈N of all primes. It is known that ( p n ) N n=1 has additive energy of exact order N 3 /(log N ), but ({ p n α}) n∈N is not metric Poissonian, i.e., there exists a set of full Lebesgue measure, such that for all α ∈ , ({ p n α}) n∈N does not have Poissonian pair correlations (see [22]). Naturally, we would also expect that under this condition on the additive energy, the sequence ({a n α}) n∈N has Poissonian pair correlations for almost all instances and, in fact, we have the following even better result, which is a consequence of better bounds on GCD sums for larger exponents than 1/2: Theorem 2 Let A N denote the first N elements of (a n ) n∈N and suppose that n∈N has Poissonian pair correlations.
However, if the additive energy is of maximal order, i.e., if we have E(A N ) = (N 3 ), then there is no α such that ({a n α}) n∈N has Poissonian pair correlations, see [14]. The approach used in [14] can be generalised to arbitrary dimensions.

does not have Poissonian pair correlations.
Classical low-discrepancy sequences in [0, 1), e.g., the van der Corput sequence, the Kronecker sequence ({nα}) n∈N and digital (t, 1)-sequences in base b ≥ 2, do not have Poissonian pair correlations (see e.g., [15]). We will derive an analogous result for the multi-dimensional version of the Kronecker sequence.

Corollary 1 For any choice of
where {·} denotes the fractional part of a real number, does not have Poissonian pair correlations.
Of course, Corollary 1 is an immediate consequence of Theorem 3. However, we also include an explicit proof of Corollary 1 as an "Appendix", since it gives an intuitive feeling for the multi-dimensional Poissonian pair correlation concept.
We also strongly believe that other multi-dimensional low-discrepancy sequences such as (t, s)-sequences and the Halton sequence do not have Poissonian pair correlations.

Remark 1
Although the metrical theory of sequences of the form ({a n α}) n∈N seems to be well-established, we do not know any explicit construction of α (not even in the one-dimensional case) such that ({a n α}) n∈N has Poissonian pair correlations. It is in general very hard to construct sequences having Poissonian pair correlations. The only known explicit examples-to the best of our knowledge-of sequences with this property are { √ n} n∈N (see [8]) and certain directions of vectors in an affine Euclidean lattice (see [9]).

Proof of Proposition 1
As (X i ) i∈N is a sequence of i.i.d. random variables having uniform distribution on Due to the fact that the random variables X k − X l , k = l, (note that the difference is considered modulo 1) are pairwise independent, we obtain that the variance of where 1(·) denotes the indicator function. Using Chebyshev's inequality, we obtain that for all , s > 0, if N is large enough. To prove now almost sure convergence, one can apply the arguments used in [4,20]. We fix a γ > 0 and define a subsequence N M along the integers, for M ≥ 1, as The variance estimate from above combined with Chebyshev's inequality and the first Borel-Cantelli lemma allow to deduce that, for all s > 0, i.e., we have now almost sure convergence along a subsequence of the integers. For N , with N M ≤ N ≤ N M+1 , we use the trivial bounds

Proof of Theorem 1
We carry out the proof for d = 2, for an arbitrary d the arguments run quite analogously. To prove the theorem, we assume in the contrary that (x n ) n∈N is not uniformly distributed and will derive a contradiction. Due to this assumption, there exists an > 0 and α, β with 0 < α, β < 1 such that for infinitely many N . Note that for simplicity, we work here with boxes anchored at the origin. One can readily adopt the following steps to arbitrary axis-parallel boxes. Hence, we can assume that for an increasing sequence of integers (N i ) i∈N we have (The case that we have "≥ αβ + " in the above expression can be treated analogously.) Let N := N i for some i ≥ 1 and assume for simplicity that √ N is an integer. For If i and/or j ≥ √ N , we set Then for all integers s and N large enough, we have Hence, If α = a (assume for simplicity that a and b are positive integers), then we have and i, j i≥a or j≥b Now, considering a standard constrained optimization problem, we get in a first step that the quadratic form Note that each B i, j consists of (2s−1) 2 −1 2 = 2s(s − 1) summands A x,y and therefore, where λ := αβ. By assumption, we have lim N →∞ F The expression R ,λ (s) − (2s) 2 can be viewed as a quadratic polynomial in s with leading coefficient Hence (6) holds for all s large enough in dependence on and λ.

Proof of Theorem 2
We adapt the steps of Lemma 3 of [4], which we will shortly repeat here.
We consider the Fourier series expansion of I N ,s (α), i.e., ( r, α ), This gives the following expression for the variance of F (d) N ,s (α). Note, due to the assumption on s, the constants implied by " " are independent of s (and of course independent of N ).
Recalling that the representation function r N (v) of an integer v is defined as we can write the previous expression as where in the sum the equality r (i) 2 w only needs to hold for these indices i for which r To further estimate the expression (8), we first derive the estimate where the implied constant depends on d and all entries of r 1 and r 2 are assumed to be non-zero. Note that compared to the one-dimensional case the exponent appearing in the GCD expression is now ≥ 2, which allows sharper estimates of the corresponding GCD sum. To see that (9) is true, we recall that r (i) , and r where the h i 's are some integers. Then, case distinctions according to the size of the h i 's, i.e., and recalling the bounds on the Fourier coefficients (7) gives the following estimate. For fixed v, w, and D := {1, . . . , d}, we have Consequently, we have for the variance of F (d) N ,s (α), using the result on GCD sums by Gál (see [10]), Then, using similar arguments as for example in the proof of Theorem 6 of [5], we can deduce the claim.

Proof of Theorem 3
The proof uses exactly the same steps, except some minor technical changes, as the one in the one-dimensional case, see [14]. To make this paper self-contained, we repeat the most important steps here. We demonstrate the proof for d = 2 only, as for general d the arguments are quite analogue. As (a n ) n∈N has maximal order of additive energy it is well-known (see [1]) that there exist constants C, K > 0 and a strictly increasing sequence of positive integers (N i ) i such that for all i ≥ 1 there is a subset is contained in a q-dimensional arithmetic progression P i (for some integer q) of size at most K N i . We call such an integer sequence quasi-arithmetic of degree q.
To be more precise, we have the following: For all i ≥ 1 there is a subset

Consider now vectors
with −(s j −1) ≤ u j ≤ (s j −1) for j = 1, . . . , q. Let γ := C 2 1+2 q , then it can be shown that there exist at least γ N different vectors u such that there exist at least γ N pairs r k , r l with r k − r l = u. In the sequel, we will refer to this observation as Property 1. Take now γ N such q-tuples u having Property 1 and consider the corresponding γ N values Let L := 2 γ , then there is a β ∈ [0, 1), such that the box β, β + L γ N 2 contains at least L elements of the form (10), say the elements We call this fact Property 2. Note that for sake of simplicity, we treat γ N and L as if they were integers. The general case can be handled analogously with some minor technical changes. For every choice of x, we consider now γ N pairs of q-tuples, say We define, for x = 1, . . . , L, the sets It can be proven that there exist x, y ∈ {1, . . . , L} with x = y such that Let now x and y satisfying (11) be given. Let be such that To sum up, we have shown that for all N i there exist at least Note, that τ < 1 and ψ only depends on d, q and C (and on K if K = 1). For every i choose now ψ i minimal such that there exist at least τ N i pairs (k, l) with 1 ≤ k = l ≤ N i , such that Of course, ψ i ≤ ψ for all i. Let now ρ := τ 1/2 C 2 3(1+2 q ) (hence ρ < τ) and assume that ψ i < ρ for infinitely many i. Therefore, we have for these i and consequently the pair correlations of ({a n α}) n∈N cannot be Poissonian. Assume now that ψ i ≥ ρ for infinitely many i. Consequently, there exist s 1 , s 2 ∈ [ρ, ψ) such that for infinitely many i. In the following, we only consider these i and we will set and s 2 := ρ + (a + 1) , for some Then, we have, due to the fact that there are at least τ N i pairs with distance equal to If ({a n α}) n∈N were Poissonian, then the above difference should converge to 4(s 2 2 − s 2 1 ) = 4(s 2 + s 1 )(s 2 − s 1 ) < τ as i → ∞, which is a contradiction to the previous inequality.
Acknowledgements Open access funding provided by Johannes Kepler University Linz. We want to thank Christoph Aistleitner for helping to improve the statement of Theorem 2.

Funding Special Upper Austrian Grant.
Open Access This article is distributed under the terms of the Creative Commons Attribution 4.0 International License (http://creativecommons.org/licenses/by/4.0/), which permits unrestricted use, distribution, and reproduction in any medium, provided you give appropriate credit to the original author(s) and the source, provide a link to the Creative Commons license, and indicate if changes were made.

Appendix: Proof of Corollary 1
We again prove the result for d = 2 only, as the general case is carried out quite analogously.
There exists a constant ρ with 0 < ρ < 1 having the following property: For every pair (α 1 , α 2 ) there exist infinitely many q ∈ N such that max({qα 1 }, {qα 2 }) < ρ q 1/2 , see, e.g., [7]. Consider now such a q and set where 0 < θ ≤ ρ. Let A = A(q) be the minimal integer such that 1 Aθ holds, which is possible due to θ ≤ ρ < 1. Note that A is the larger, the larger θ is. Hence, the values of A are bounded by the value obtained for θ = ρ. This A will be denoted by A ρ . Further, for the choice of B = B(q) := 2 1+θ 2 , we have B ≥ 2 1+ρ 2 > 1. Choose L = L(q) := 1 Aθ 2/3 and the realν such that L θ i.e.,ν In the sequel, we will show that q L 2 θ 2 ≥ B Lq, (13) and consequently,ν Clearly, Eq. (13) which is true due to the definition of A and B, respectively. Let ν := ν and N := A 2 Lq − ν. Note, that by (14) we have N ≥ B Lq and this, by the definition of B and L tends to infinity for q to infinity.
Using the estimate (14), we derive that there are such pairs, where γ is a positive fixed constant independent on q. Now, for each such pair, we get (for k = 1, . . . , N − q L) The second equality is true due to the following inequality which we will prove subsequently. First, note that we have where we used the estimate (14) forν. Further, due to above estimate and (12), we also have i.e., As the inequality from above is valid for infinitely many q and as a consequence thereof, there exists an a ∈ 0, 1, . . . , 3 100 γ such that for infinitely many q.