Search arXivSearch

arXiv · 2310.19578

Effective pair correlations of fractional powers of complex grid points

Abstract

Using a standard definition of fractional powers on the universal cover $\exp:S\to \mathbb{C}^*$ seen as an infinite helicoid embedded in $\mathbb{R}^3$, we study the statistics of pairs from the countable family $\{n^α\, : \, n \in \exp^{-1}(Λ) \}$ for every complex grid $Λ$ and every real parameter $α\in \, ]0,1[\,$. We prove the convergence of the empirical pair correlations measures towards a rotation invariant measure with explicit density. In particular, with the scaling factor $N\mapsto N^{1-α}$, we prove that there exists an exotic pair correlation function which exhibits a level repulsion phenomenon. For other scaling factors, we prove that either the pair correlations are Poissonian or there is a total loss of mass. In addition, we give an error term for this convergence, with explicit dependence on parameters of the grid $Λ$.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Rafael Sayous. 2024-09-09. Effective pair correlations of fractional powers of complex grid points. https://doi.org/10.2140/cnt.2025.14.13

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Asymptotic density of k-almost primes

Landau's well known asymptotic formula $$N_k(x):=\ \mid\{n\leq x : Ω(n)=k\}\mid \ \sim \left( \frac{x}{\log x} \right) \frac{(\log\log x)^{k-1}}{(k - 1)!}\ \ (x \rightarrow \infty),$$ which also holds for $$π_k(x):=\ \mid\{n\leq x : ω(n)=k\}\mid,$$ is known to be fairly poor for $k > 1$, and when $k$ is allowed to tend to infinity with $x$, the study of $N_k(x)$ and $π_k(x)$ becomes very technical [1, Chapter II.6, $§$ 6.1, p.200]. I hope to show that the method described below provides not only a more accurate approach, but rather increases in its asymptotic accuracy as $k$ tends to infinity.

math.NT

Transcendence Meets Normality: Construction of Transcendentally Normal Numbers

In this work, we study real numbers $x$ for which $p(x)$ is (absolutely) normal for every non-constant integer-valued polynomial $p$. We call such numbers transcendentally normal. We prove that almost every real number is transcendentally normal and provide an explicit construction of such a number, based on Sierpinski's covering method and novel ideas involving the so-called stretch function. In the next step, we transform this construction into an algorithm that computes the digits of a t-normal number recursively in all integer bases. Moreover, we extend our covering approach to construct and compute LIL-normal numbers whose discrepancies are of the order predicted by the law of the iterated logarithm. We also take the opportunity to discuss several interesting open problems.

math.NT