Search arXivSearch

arXiv · 2401.06100

Special values of $p$-adic $L$-functions and Iwasawa $λ$-invariants of Dirichlet characters

Abstract

We investigate the Iwasawa $λ$-invariant $λ_p(χ)$ of the $p$-adic $L$-function associated with a Dirichlet character $χ$ for odd primes $p$. Using special values of the $p$-adic $L$-function and its derivative, we derive novel and computationally efficient criteria to distinguish between the cases $λ= 0$, $λ= 1$, $λ= 2$, and $λ\geq 3$. In particular, we study the case when the $p$-adic $L$-function vanishes at $s=0$. Building on the results of Ferrero-Greenberg and of Gross-Koblitz, we establish explicit conditions for $λ_p(χ) >1 $ and $λ_p(χ) > 2$. Furthermore, we extend the methods of Ernvall-Metsänkylä and of Dummit et al. to calculate the $λ$-invariant. This is achieved by twisting $χ$ by characters $ψ$ of $p$-power order and using the values of the $p$-adic $L$-function at $s=2-p, \dots, 0$. Additionally, we utilize the value at $s=1$ to compute $λ_p(χ)$. Finally, these results are applied to generate numerical data on the distribution of $λ$-invariants, when either the prime $p$ or the Dirichlet character $χ$ is fixed.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Heiko Knospe. 2026-08-29. Special values of $p$-adic $L$-functions and Iwasawa $λ$-invariants of Dirichlet characters. https://doi.org/10.1007/s40993-026-00762-x

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