Search arXivSearch

arXiv · 2608.25450

Arithmetic theta invariants and arithmetic equilibrium measures

Abstract

We introduce two new arithmetic invariants associated with Hermitian line bundles on arithmetic varieties, which play the role of the Bergman distortion function in the arithmetic setting. As a first step, we show that these two functions are asymptotically equivalent. This leads to the introduction of an intrinsic measure $ \widehatμ^{\sup}_{\mathrm{eq}},$ which we show to be a natural arithmetic analogue of the equilibrium measure. We prove that $\widehatμ^{\sup}_{\mathrm{eq}}$ serves as a detector of arithmetic positivity. In particular, we determine it for weakly nef Hermitian line bundles and, in full generality, in the toric case. Moreover, $\widehatμ^{\sup}_{\mathrm{eq}}$ governs the arithmetic volume function and its variational properties. More precisely, we establish weak integral representations of the arithmetic volume and of its first variation in terms of $\widehatμ^{\sup}_{\mathrm{eq}}$. These formulas provide a measure-theoretic interpretation of the volume derivative of Yuan--Zhang and reveal a structural parallel with variational formulas in complex pluripotential theory. Our approach differs fundamentally from previous treatments based on Harder--Narasimhan filtrations or arithmetic Okounkov bodies. It places the arithmetic volume at the center of the theory and suggests that asymptotic volume invariants, rather than heights, provide the natural analytic framework for problems in equidistribution and arithmetic dynamics.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Mounir Hajli. 2026-08-26. Arithmetic theta invariants and arithmetic equilibrium measures. https://arxiv.org/abs/2608.25450

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