Pith. sign in

REVIEW 2 major objections 3 minor 31 references

Metric Poissonian pair correlation for real sequences and energy estimates

T0 review · 2 major / 3 minor · reviewed 2026-08-15 · deepseek-v4-flash

Challenge this review Re-run · record.json Download PDF Read on arXiv ↗ Review JSON

Pith's one-line read A real sequence is metric Poissonian when its approximate additive energy and its large-gap sums satisfy two power bounds; quantitatively convex and polynomial sequences meet them.

desk verdict Good ideas and genuinely new results, but a real gap in the proof of Theorem 4.1 (the J = N0^2/L^2 issue) means the main theorems are not yet established as written. read the letter →

arxiv 2506.17031 v2 pith:ZWO7SMTG submitted 2025-06-20 math.NT

Bryce Kerr , Hongliang Wang This is my paper · ORCID
classification math.NT MSC 11K0611K3111B3011L07
keywords metricPoissonianpaircorrelationapproximateadditiveenergyrealsequenceslatticepointcountingDirichletpolynomialmeanvaluesconvex
verification ladder T0 review T1 audit T2 compute T3 formal

The pith

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

The reading

This paper establishes new sufficient conditions for a real sequence to be metric Poissonian: scaled copies of the sequence have pair correlations matching a Poisson process for almost every scaling factor. The main theorem requires three quantitative hypotheses: gaps cannot shrink too fast, an approximate additive energy E*_{N,1/N} must fall a power below $N^{3}$, and a weighted count of large gaps must grow mildly. If these hold, the fractional parts are pseudo-random at the pair-correlation scale. As applications, quantitatively convex sequences and all real polynomials of degree at least two are shown to be metric Poissonian, answering open questions from earlier work.

What carries the argument

The argument reduces metric Poissonian pair correlation to counting lattice points in regions defined by inequalities |m1x1−m2x2| ≤ K, where x1 and x2 are differences of the original sequence. The central objects are the approximate additive energy E*_{N,γ}, counting quadruples with |xn1−xn2+xn3−xn4| < γ, and the weighted large-gap sum appearing in (2.3). A set of recursive inequalities, derived from geometry of numbers and mean values of Dirichlet polynomials, lets the proof inflate and shrink the parameter K while keeping the relevant counting problem under control; the final bound is expressed directly in the two quantities named in the theorem.

What would settle it

One concrete test is to compute, for the sequence x_n = $n^{{3/4}}$, the quantities E*_{N,1/N} and the large-gap sum in (2.3) for growing N, and to compare the pair correlation of (α $n^{{3/4}}$) against the Poisson limit 2s; if the pair correlation visibly fails while both numerical bounds hold, Theorem 2.1 would be false. A more direct check for any candidate sequence is the lattice-counting condition from the reduction theorem: if the number of solutions to |m1(xn1−xn2)−m2(xn3−xn4)| < N^ε exceeds $N^{{4−δ}}$ for every δ > 0, the sequence cannot be metric Poissonian.

Watch

Extended reading notes

Core claim

The central claim is Theorem 2.1: for a positive real sequence with gaps xn+1−xn ≥ c $n^{{η−1}}$ for some η in (2/3,1], the approximate energy bound E*_{N,1/N} ≪ $N^{{3−κ−δ}}$, and the weighted large-gap estimate Σ_{1≤n1<n2≤N, xn2−xn1≥1} (xn2−xn1)^{−1/2} ≪ $N^{{1+κ/2}}$, together imply that the sequence is metric Poissonian. This improves the previous bounded-gap energy threshold from $N^{{183/76−δ}}$ to $N^{{5/2−δ}}$, and under a mild extra assumption it answers positively the open question whether a γ≈1/N energy condition suffices. The proof goes through a lattice-point counting reduction and a system of recursive inequalities for weighted sums over differences, ultimately controlling the relevant counting problem in terms of the approximate energy and the large-gap sum.

Load-bearing premise

The weighted large-gap bound (2.3) is the most delicate premise: it enters at one step of the final estimate, the paper notes it may be weakened, and a sequence violating it falls outside the theorem even if it is metric Poissonian.

Editorial extensions

If this is right

  • Any sequence satisfying conditions (2.1), (2.2), and (2.3) has pair correlation converging to the Poisson limit 2s for almost every α.
  • For sequences with a uniform positive gap, the energy bound E*_N ≪ N^{5/2−δ} alone is sufficient, improving the earlier 183/76 threshold.
  • Quantitatively convex sequences, whose gaps increase by at least c n^{−1/10^4}, are metric Poissonian.
  • Every real polynomial of degree at least two gives a metric Poissonian sequence.
  • The energy estimates for convex and polynomial sequences are stated independently and can serve as tools outside the pair-correlation problem.

Reading between the lines

Editorial extensions of the paper, not claims the author makes directly.

  • Beyond the paper's claims, the condition η > 2/3 is described as technical and likely not sharp; a sharper recursive inequality could plausibly lower it, perhaps toward the point where the energy and large-gap bounds naturally balance.
  • Condition (2.3) is probably not necessary for the metric Poissonian property; the proof uses it only to dominate one error term, so sequences with many large gaps but still Poissonian correlations are plausible candidates for a refined theorem.
  • The same energy-estimate machinery could be tested on divisor-sum sequences of the form σ_β(n), which the paper mentions but does not resolve; a first step would be computing the analogue of E*_{N,1/N} for such sequences.
  • The lattice-point bound Theorem 4.1 is a standalone estimate for weighted difference sets and may apply to other problems where approximate additive energy and large-gap structure are the only relevant statistics.
Share X Bluesky LinkedIn Reddit HN

Signed reviews

No signed human review yet.

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, and a circularity audit.

Referee Report

2 major / 3 minor

Summary. The paper proposes a new sufficient condition for a real sequence (x_n) to be metric Poissonian. Theorem 2.1 requires a weakened gap condition x_{n+1}-x_n >= c n^{eta-1} with eta in (2/3,1], an approximate-energy bound E*_{N,1/N} << N^{3-kappa-delta}, and a weighted large-gap sum bound. The proof reduces the metric Poissonian problem, via a theorem of Rudnick and Technau, to a lattice point counting estimate S(X,alpha,M,K), which is then attacked through a sequence of recursive inequalities (Propositions 4.3-4.7). Applications are given to quantitatively convex sequences and to polynomial sequences, using energy estimates proved with results of Bloom and of Bourgain-Demeter-Guth and Wooley.

Significance. If the proof is completed, the results constitute a substantial advance over Aistleitner-El-Baz-Munsch: they allow gaps that decay polynomially rather than requiring a uniform lower bound, and they replace the coarse energy E*_N by the finer E*_{N,1/N}. The paper also answers an open problem of Aistleitner-El-Baz-Munsch under the additional weight condition (2.3), and it gives the first metric Poissonian results for general convex and polynomial sequences. The recursive lattice-pointing-counting framework is a genuinely different technical route from earlier work. However, the current version contains a load-bearing gap in the proof of Theorem 4.1 and an arithmetic slip in Proposition 9.1; these need to be repaired before the main claims are established.

major comments (2)
  1. [Section 4.3, paragraph applying Proposition 4.6] The proof of Theorem 4.1 applies Proposition 4.6 with J = N_0^2/L^2 after Proposition 4.5 has only produced L <= 4N_0. When N_0 < L <= 4N_0, we have J in [1/16,1), so the hypothesis J >> 1 of Proposition 4.6 is not satisfied; its proof requires a prime q in [4J,8J], which does not exist for J < 1/4, and the claimed inequality eS(X_k,alpha,N,K) << J^{-1} eS(X_k,alpha,theta J N, J K) is in fact false for J < 1 in general, e.g. with X_k={x}, alpha(x)=1, K/x=1/J one gets LHS of order N/J and RHS of order N. The subsequent applications of Lemma 4.2 and Proposition 4.4 with parameters LN/(N_0K) and N_0/L also require L <= N_0. Since the case N_0 < L <= 4N_0 is not treated, Theorem 4.1 is not established as written, and therefore the application of Theorem 4.1 in Section 8.1 to prove (8.10) is unsupported. The authors should either prove a version of Proposition 4.6 valid for J in [c,1) for some c>0, ensure that L can be chosen with L <= N_0, or handle the large-L case by a separate argument.
  2. [Section 9.1, after Eq. (9.7)] The displayed chain after (9.7) loses a power of K. From Lemma 9.3 and Lemma 9.4 one obtains E(X)^{1/4} << N^{o(1)} K^{77/200} N^{123/200}; raising to the fourth power and using (9.6) gives E*_N << N^{1/100} K^{77/50} N^{123/50+o(1)} = N^{12427/5000+o(1)} because K = N^{1/100}, not N^{247/100+o(1)} as stated. The corrected exponent 12427/5000 is still smaller than 5/2, so Corollary 2.4 remains valid, but the statement of Proposition 9.1 and the surrounding calculation should be corrected.
minor comments (3)
  1. [Section 9.2, Eq. (9.9)] The displayed definition alpha(k) = 4/(k(k+1)) - 2 appears to be a typo: the Hölder interpolation immediately before it requires alpha(k) = 4/(k(k+1)-2). With the printed definition the subsequent exponent computation does not go through.
  2. [Section 8.1, display after applying Theorem 4.1] The displayed bound for S(X_+,alpha,N^{1+epsilon},N^epsilon) omits the factors N^{O(epsilon)} coming from K^{1+o(1)}, (MK)^{1/2+o(1)} and (MK)^{1+o(1)} in Theorem 4.1. These can be absorbed by choosing epsilon sufficiently small in Proposition 8.1, but the display should either retain them or explicitly state this convention.
  3. [General] There are several minor typographical issues, e.g. 'there exits' in Theorem 3.1 and 'Zaharescru' in the introduction; these should be corrected in a final revision.

Circularity Check

0 steps flagged · score 0.0 of 10

Derivation is self-contained; no circular reduction of the metric Poissonian conclusion to its hypotheses.

full rationale

The claimed derivation chain is genuinely hierarchical rather than circular. Theorem 2.1 is reduced, via the external Rudnick–Technau criterion (Theorem 3.1), to two counting estimates (8.1) and (8.2). The first follows from the spacing assumption (2.1), and the second is bounded by the lattice-point sum S(X,alpha,N^{1+varepsilon},N^varepsilon). Theorem 4.1, which bounds this sum, is proved from Propositions 4.3–4.7; those propositions are proved within Sections 5–7 using dyadic decomposition, geometry of numbers, and Dirichlet polynomial mean-value estimates. The final bound is expressed in terms of ||alpha||_1, ||alpha||_{2,N}, and the weighted large-gap sum, which Section 8.1 then bounds respectively by N^2, (E*_{N,1/N})^{1/2}, and the left-hand side of (2.3). Substituting assumptions (2.2) and (2.3) yields S << N^{4-delta/2+o(1)}, and Proposition 8.1 combined with Theorem 3.1 gives the metric Poissonian property. No parameter is fitted to force the conclusion, and no step identifies the conclusion with an assumption by construction. The cited external inputs—Rudnick–Technau, Heath-Brown, Bloom, Bourgain–Demeter–Guth, and Wooley—are not authored by the present authors and do not themselves state the metric Poissonian conclusion. The skeptic-flagged issue concerning Proposition 4.6 being applied with J = N_0^2/L^2 possibly below 1 is an internal proof-validity concern, not a circularity. The paper is self-contained against external benchmarks, so the appropriate circularity score is 0.

Assumptions & free parameters 0 free parameters · 4 assumptions · 0 invented entities

The paper introduces no fitted parameters and no new postulated entities. The central claim rests on external theorems: the Rudnick-Technau reduction to lattice point counting, Bloom's convex-set energy bound, Vinogradov mean value estimates, and standard geometry of numbers results. These are prior published results and are not circular with the new results, but they are unproved here.

assumptions (4)
  • domain assumption Rudnick-Technau reduction (Theorem 3.1): metric Poissonian follows from lattice-point estimates (8.1) and (8.2).
    Invoked in Section 8 as the bridge from pair-correlation statistics to counting lattice points; not proved in this paper.
  • domain assumption Bloom's additive energy bound for convex sets (Lemma 9.3): E(A) << |A|^{123/50+o(1)}.
    Used in the proof of Proposition 9.1 for the additive energy of integer discretizations; cited from [7].
  • domain assumption Vinogradov mean value estimate of Bourgain-Demeter-Guth and Wooley (Lemma 9.5).
    Used to prove Lemma 9.6 and the polynomial energy estimate in Proposition 9.2; cited from [11] and [31].
  • standard math Minkowski's second theorem and lattice-point counting via successive minima (Lemmas 6.1 and 6.2).
    Background geometry-of-numbers results used in the proof of Proposition 4.5.

how reviews work

0 comments
Cite this review

Pith. "Pith review of Metric Poissonian pair correlation for real sequences and energy estimates." pith.science (2026). https://pith.science/paper/ZWO7SMTG

@misc{pith2026250617031,
  author       = {Pith},
  title        = {Pith review of: Metric Poissonian pair correlation for real sequences and energy estimates},
  year         = {2026},
  howpublished = {\url{https://pith.science/paper/ZWO7SMTG}},
  note         = {Machine review of arXiv:2506.17031}
}
read the original abstract

We establish new conditions under which a sequence of real numbers has metric Poissonian pair correlation. These conditions strengthen results of Aistleitner, El-Baz and Munsch (2021) and resolve one of their open problems under a mild growth assumption. As applications, we show that quantitatively convex and polynomial sequences have metric Poissonian pair correlation.

Review history (2 revisions) →

Discussion (0). Continue with ORCID to comment.

Reference graph

Works this paper leans on

31 extracted references · 30 canonical work pages

  1. [1]

    Aistleitner, D

    C. Aistleitner, D. El-Baz, and M. Munsch, A pair correlation problem, and counting lattice points with the zeta function , Geom. Funct. Anal. 31 (2021), no. 3, 483–512

    work page 2021

  2. [2]

    Aistleitner, T

    C. Aistleitner, T. Lachmann, and F. Pausinger, Pair correlations and equidistribution, J. Number Theory 182 (2018), 206–220

    work page 2018

  3. [3]

    Aistleitner, T

    C. Aistleitner, T. Lachmann, and N. Technau, There is no Khintchine threshold for metric pair correlations, Mathematika 65 (2019), no. 4, 929–949. POISSONIAN PAIR CORRELATION AND ENERGY ESTIMATES 39

    work page 2019

  4. [4]

    Aistleitner, G

    C. Aistleitner, G. Larcher, and M. Lewko, Additive energy and the Hausdorff dimen- sion of the exceptional set in metric pair correlation problems , Israel J. Math. 222 (2017), no. 1, 463–485, With an appendix by Jean Bourgain

    work page 2017

  5. [5]

    Metric Poissonian pair correlationa and additive energy

    T. Bera and E. Malavika, Metric poissonian pair correlation and additive energy, 2025, arXiv:2506.15274

    work page Pith review arXiv 2025

  6. [6]

    M. V. Berry and M. Tabor, Level clustering in the regular spectrum , Proc. R. Soc. Lond. A 356 (1977), 375–394

    work page 1977

  7. [7]

    T. F. Bloom, Control and its applications in additive combinatorics , 2025, arXiv:2501.09470

    arXiv 2025

  8. [8]

    T. F. Bloom, S. Chow, A. Gafni, and A. Walker, Additive energy and the metric Poissonian property, Mathematika 64 (2018), no. 3, 679–700

    work page 2018

Show all 31 references
  1. [9]

    T. F. Bloom and A. Walker, GCD sums and sum-product estimates , Israel J. Math. 235 (2020), no. 1, 1–11

    2020

  2. [10]

    Boca and A

    F. Boca and A. Zaharescu, Pair correlation of values of rational functions (mod p), Duke Math. J. 105 (2000), no. 2, 267–307

    2000

  3. [11]

    Bourgain, C

    J. Bourgain, C. Demeter, and L. Guth, Proof of the main conjecture in Vinogradov’s mean value theorem for degrees higher than three, Ann. of Math. (2) 184 (2016), no. 2, 633–682

    2016

  4. [12]

    Br¨ udern, K

    J. Br¨ udern, K. Kawada, and T. D. Wooley,Additive representation in thin sequences, VIII: Diophantine inequalities in review , Number theory, Ser. Number Theory Appl., vol. 6, World Sci. Publ., Hackensack, NJ, 2010, pp. 20–79

    2010

  5. [13]

    Chaubey, M

    S. Chaubey, M. Lanius, and A. Zaharescu, Pair correlation of fractional parts derived from rational valued sequences, J. Number Theory 151 (2015), 147–158

    2015

  6. [14]

    El-Baz, J

    D. El-Baz, J. Marklof, and I. Vinogradov, The two-point correlation function of the fractional parts of √n is Poisson , Proc. Amer. Math. Soc. 143 (2015), no. 7, 2815– 2828

    2015

  7. [15]

    D. R. Heath-Brown, A large values estimate for Dirichlet polynomials , J. London Math. Soc. (2) 20 (1979), no. 1, 8–18

    1979

  8. [16]

    184 (2018), no

    , The differences between consecutive smooth numbers, Acta Arith. 184 (2018), no. 3, 267–285

    2018

  9. [17]

    Larcher and W

    G. Larcher and W. Stockinger, Pair correlation of sequences ({anα})n∈N with maximal additive energy, Math. Proc. Cambridge Philos. Soc. 168 (2020), no. 2, 287–293

    2020

  10. [18]

    , On pair correlation of sequences , Discrepancy theory, Radon Ser. Comput. Appl. Math., vol. 26, De Gruyter, Berlin, [2020] ©2020, pp. 133–145

    2020

  11. [19]

    Lutsko, A

    C. Lutsko, A. Sourmelidis, and N. Technau, Pair correlation of the fractional parts of αnθ, J. Eur. Math. Soc. (JEMS) 27 (2025), no. 10, 4069–4082

    2025

  12. [20]

    Marklof, The Berry-Tabor conjecture, European Congress of Mathematics, Vol

    J. Marklof, The Berry-Tabor conjecture, European Congress of Mathematics, Vol. II (Barcelona, 2000), Progr. Math., vol. 202, Birkh¨ auser, Basel, 2001, pp. 421–427

    2000

  13. [21]

    Radziwi l l and A

    M. Radziwi l l and A. Shubin, Poissonian pair correlation for αnθ mod 1, Int. Math. Res. Not. IMRN (2024), no. 9, 7654–7679

    2024

  14. [22]

    Rudnick and P

    Z. Rudnick and P. Sarnak, The pair correlation function of fractional parts of polyno- mials, Comm. Math. Phys. 194 (1998), no. 1, 61–70

    1998

  15. [23]

    Rudnick, P

    Z. Rudnick, P. Sarnak, and A. Zaharescu, The distribution of spacings between the fractional parts of n2α, Invent. Math. 145 (2001), no. 1, 37–57

    2001

  16. [24]

    Rudnick and N

    Z. Rudnick and N. Technau, The metric theory of the pair correlation function of real-valued lacunary sequences, Illinois J. Math. 64 (2020), no. 4, 583–594

    2020

  17. [25]

    , The metric theory of the pair correlation function for small non-integer pow- ers, J. Lond. Math. Soc. (2) 106 (2022), no. 3, 2752–2772

    2022

  18. [26]

    Rudnick and A

    Z. Rudnick and A. Zaharescu, A metric result on the pair correlation of fractional parts of sequences, Acta Arith. 89 (1999), no. 3, 283–293

    1999

  19. [27]

    I. D. Shkredov, Some new results on higher energies, Trans. Moscow Math. Soc. (2013), 31–63. 40 B. KERR AND H. W ANG

    2013

  20. [28]

    Tao and V

    T. Tao and V. H. Vu, Additive combinatorics, paperback ed., Cambridge Studies in Advanced Mathematics, vol. 105, Cambridge University Press, Cambridge, 2010

    2010

  21. [29]

    Walker, The primes are not metric Poissonian , Mathematika 64 (2018), no

    A. Walker, The primes are not metric Poissonian , Mathematika 64 (2018), no. 1, 230–236

    2018

  22. [30]

    Watt, Exponential sums and the Riemann zeta-function

    N. Watt, Exponential sums and the Riemann zeta-function. II , J. London Math. Soc. (2) 39 (1989), no. 3, 385–404

    1989

  23. [31]

    T. D. Wooley, Nested efficient congruencing and relatives of Vinogradov’s mean value theorem, Proc. Lond. Math. Soc. (3) 118 (2019), no. 4, 942–1016. B.K.: School of Science, University of New South W ales, Canberra, ACT, Australia Email address: bryce.kerr89@gmail.com H.W.: S...

    2019

Pith tools

Reviewed August 15, 2026 · model on record in the stance chip above.