Search arXivSearch

arXiv · 2501.17535

Probabilistic interpretation of the Selberg--Delange Method in analytic number theory

Abstract

In analytic number theory, the Selberg--Delange Method provides an asymptotic formula for the partial sums of a complex function $f$ whose Dirichlet series has the form of a product of a well-behaved analytic function and a complex power of the Riemann zeta function. In probability theory, mod-Poisson convergence is a refinement of convergence in distribution toward a normal distribution. This stronger form of convergence not only implies a Central Limit Theorem but also offers finer control over the distribution of the variables, such as precise estimates for large deviations. In this paper, we show that results in analytic number theory derived using the Selberg--Delange Method lead to mod-Poisson convergence as $x \to \infty$ for the number of distinct prime factors of a randomly chosen integer between $1$ and $x$, where the integer is distributed according to a broad class of multiplicative functions. As a Corollary, we recover a part of a recent result by Elboim and Gorodetsky under different, though related, conditions: A Central Limit Theorem for the number of distinct prime factors of such random integers.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Maximilian Janisch. 2025-01-29. Probabilistic interpretation of the Selberg--Delange Method in analytic number theory. https://arxiv.org/abs/2501.17535

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