Metric Poissonian Pair Correlation Property Part 1: The Case n+ n
summary
The gist
We prove that (α(n + log n))n≥1 has Poissonian pair correlation for Lebesgue almost every real α <ref:2610.228365, this solves a Problem posed by Aistleitner, El-Baz and Munsch [Open Problem 2, Geom.
In short
The paper investigates whether a sequence defined by $\alpha(n + \log n)$ has Poissonian pair correlation for almost every real number $\alpha$. It proves this property holds, solving an open problem posed by Aistleitner, El-Baz, and Munsch. This result establishes a form of local pseudorandomness for this specific sequence.
Key concepts
- Pair Correlation
- This measures the relative positions of points at a scale related to the mean spacing of the sequence. A sequence has Poissonian pair correlation if its limiting pair count matches that of an independent uniform random model at that scale, indicating local pseudorandomness.
- Metric Poissonian Property
- This property examines whether a fixed integer or real sequence exhibits Poissonian pair correlation for almost every parameter ($\alpha$). It is a metric version of the property, focusing on the distribution of points in $\mathbb{R}$ rather than just integers.
- Additive Energy $E(AN)$
- This is an analytic tool used to characterize the metric Poissonian property for integer sequences. A small bound on this energy (specifically $E(AN) \ll N^3 - \delta$) implies the sequence possesses the desired local pseudorandomness.
- Localization via Mellin Reduction
- This is an analytic technique used to estimate correlation statistics by decomposing sums into frequency and difference components. It involves Fourier expansion and dyadic decomposition to localize the error terms in $\alpha$, allowing for precise quantitative bounds.
Terminology used across episodes
This episode discusses
- Metric Poissonian Pair Correlation Property Part 1: The Case n+ n · Paper Radio
- Metric Poissonian pair correlation for real sequences and energy estimates
- Additive energy, discrepancy and Poissonian k-level correlation
The paper
Metric Poissonian Pair Correlation Property Part 1: The Case n+ n · Read on arXiv
School of Mathematics and Statistics, Huazhong University of Science and Technology
We prove that (α(n+ n)) n at least1 has Poissonian pair correlation for Lebesgue almost every real α. This solves a Problem posed by Aistleitner, El-Baz and Munsch [Open Problem 2, Geom. Funct. Anal. 2021].
Transcript
Introduction to the show: ident: Mathematics. The day in mathematics: new theorems, new proofs, and what they open.
Ada: I'm Ada.
Emmy: And I'm Emmy, here with Kolya.
Ada: We're looking at the paper: "Metric Poissonian Pair Correlation Property Part 1".
Emmy: Here's the gist of the paper. We prove that (α(n + log n))n≥1 has Poissonian pair correlation for Lebesgue almost every real α <ref:2610.228365, this solves a Problem posed by Aistleitner, El-Baz and Munsch
Open Problem 2, Geom. [Ada: Funct.
Emmy: Anal.
Ada: 2021]<ref:2610.22836#pg4>.
Paper summary: Ada: So we're looking at this paper, "Metric Poissonian Pair Correlation Property Part one: The Case n plus n," and what they’ve established about sequences that grow like n plus log n <ref:2610.22836#pg1,Metric Poissonian Pair Correlation Property Part 1: The Case n>. What they claim is that for Lebesgue almost every real number alpha, the sequence with the terms a sub n is alpha times a plus log n has Poissonian pair correlation.
Emmy: That sounds like it tackles one of those open problems posed by Aistleitner, El-Baz and Munsch in two thousand twenty-one <ref:2610.22836#pg1,posed by Aistleitner, El-Baz and Munsch>. The core thesis here is that this specific growth rate, n plus log n, provides the metric Poissonian property for almost all real alpha.
Kolya: What does this mean in practical terms? Is it just about a sequence being uniformly distributed modulo one, or is it something stronger regarding how points are actually distributed?
Ada: It’s more than just uniform distribution modulo one. As the paper says, metric Poissonian pair correlation describes a form of local pseudorandomness where a deterministic sequence has the same limiting pair count as independent uniform points at the scale of the mean spacing.
Emmy: That ties into what they’re doing with sequences modulo one, which has been studied since Weyl's work. They are connecting this metric result back to those earlier understandings of uniform distribution and pair correlation two <ref:2610.22836#pg1>.
Kolya: So, if we think about what the paper is really saying about the fluctuations in these counts—what kind of control do we get over those fluctuations?
Ada: The paper establishes a quantitative estimate for the smoothed statistic. Specifically, they show that for Lebesgue almost every alpha, simultaneously for every s greater than or equal to zero, the pair count limit is o N equals two s two <ref:2610.22836#pg1>.
Emmy: And they provide an explicit bound on how the difference between the empirical count and its continuous limit behaves. They get a bound that looks like it involves I over g N minus seven thirds times E of two over n plus N minus two log four of two n <ref:2610.22836#pg2>.
Kolya: That error term looks complex, involving the four point counting estimate and some localized Mellin reduction. What does that bound really tell us about the tail behavior? Does it suggest the fluctuations are controlled well enough for almost all alpha?
Ada: Yes, they show that by combining Proposition two point two and Proposition three point one, they obtain an error term bounded by I over g N minus one third log two of two n plus N minus two log four of two n <ref:2610.22836#pg6>.
Emmy: And for the full result, they use Chebyshev’s inequality and the first Borel–Cantelli lemma to show convergence for almost all alpha in a set Iq, which covers almost every real number alpha <ref:2610.22836#pg6>.
Kolya: So, what’s the big picture for someone who just listens to this show? This paper addresses a specific type of sequence growth—n plus log n—and shows that it exhibits Poissonian pair correlation for almost all real parameters alpha, which is a significant step toward understanding the metric behavior of these sequences.
Ada: Exactly. It’s solving one of those open problems that Aistleitner, El-Baz and Munsch posed in two thousand twenty-one regarding the n plus log n case <ref:2610.22836#pg4>. It connects this to the broader program they started with their companion paper on the n log n case.
Emmy: The title itself, "Metric Poissonian Pair Correlation Property Part one: The Case n plus n," tells you exactly where this sits in their overall investigation into metric pair correlation, which is a major area in number theory and dynamical systems <ref:2610.22836#pg1,Metric Poissonian Pair Correlation Property Part 1: The Case n>.
Ada: So, the implication is that for sequences growing this slowly—like n plus log n—we have strong evidence of local pseudorandomness across almost all parameters alpha. It’s a concrete result about how deterministic sequences behave locally in terms of point distribution.
Emmy: And it confirms that the method they developed, using Fourier expansion and dyadic decomposition for localization, works effectively for this specific sequence structure <ref:2610.22836#pg10>. It shows the analytic machinery is sound here.
Kolya: I wonder about the limitations. What does the paper flag as not being settled? Are there other sequence types where this doesn't hold, or what kind of behavior are they not looking at with this specific result?
Ada: The paper itself points out that it’s only the first part of a two-paper effort. They have a companion paper specifically for the n log n case <ref:2610.22836#pg4>. So, this result is just one piece of a larger puzzle concerning these metric results.
Emmy: It shows that when you move from fixed integer sequences to sequences where the exponent itself is a parameter, like in this case with alpha, the structure becomes much richer and allows for this kind of almost everywhere statement. It’s about how the parameter affects the geometry of the problem.
Kolya: So, to summarize what we heard: they proved that n plus log n sequences have Poissonian pair correlation for almost all alpha, which is a key metric result in this area, and they provided quantitative bounds on the error term controlling those fluctuations <ref:2610.22836#pg2>.
Ada: That’s right. It solidifies the understanding of local pseudorandomness for these slowly growing sequences and provides a foundation for their companion work on n log n sequences <ref:2610.22836#pg4>.
Conclusion: Ada: So we’re wrapping up on this paper about the metric Poissonian pair correlation property for n plus n sequences.
Emmy: It’s interesting how they tackle this specific growth rate, showing that for almost every real number alpha, these sequences behave in a very structured way locally.
Kolya: So, what is the actual implication here? What does it change about how we think about these deterministic sequences?
Ada: It solidifies a kind of local pseudorandomness. It means that even though the sequence is determined by a specific number alpha, when you look at points in that sequence, their distribution mimics independent random points.
Emmy: The authors are showing this through precise math, using techniques like Fourier expansion and dyadic decomposition to get those tight bounds on the error terms.
Kolya: I’m looking at the numbers they give, and it seems like for almost any alpha you pick, these bounds hold up pretty well across all scales. But what about the constant factors in those bounds? Do they stay small?
Ada: The paper focuses on showing that for almost every alpha, there are no issues with those constants blowing up. It's about controlling the error term so it doesn't ruin the Poissonian behavior for most of the parameter space.
Emmy: It’s a statement about structure in number theory—that even when you introduce a parameter like alpha, the underlying geometry of these point distributions is often quite uniform.
Kolya: So, we have this strong statement about almost every alpha for n plus n sequences holding true across all scales without blowing up?
Ada: That’s the main thing. It settles one part of that big question posed by Aistleitner and his collaborators back in twenty twenty-one.
Emmy: This result opens the door to looking at more complex sequence growths, like those involving n log n, which they tackle in a separate paper.
Kolya: And we’ll have to see if that same kind of almost everywhere statement holds for those slower growing sequences as well.
More episodes
- 2508.20749-Rates of convergence for extremal spacings in Kakutani's random interval-splitting process
- 2509.05860-Concentration Inequalities for Branching Random Walks
- 2509.19309-Small Prime Primitive Roots in Arithmetic Progressions
- 2509.21830-Noncollapsing for Curvature Flows with Inhomogeneous Speeds
- 2510.08346-Separability and Submetrizability in Locally Convex Spaces
- 2510.27290-Borel Combinatorics of Schreier Graphs of Z-actions
- 2511.13500-Sampling Density for Gabor Phase Retrieval
- 2511.19161-Linear dynamics of random products of weighted shifts
- 2511.21548-Metastability of diffusion processes in narrow tubes
- 2512.01536-Abelian approximations for bicrossed products