Search arXivSearch

arXiv · 2207.13902

On large Iwasawa $λ$-invariants of imaginary quadratic function fields

Abstract

Let $\ell$ be a prime number and $q$ be a power of $\ell$. Given an odd prime number $p$ and an imaginary quadratic extension $F$ of the rational function field $\mathbb{F}_q(T)$, let $λ_p(F)$ denote the Iwasawa $λ$-invariant of the constant $\mathbb{Z}_p$-extension of $F$. We show that for any number $r>0$ and all large enough values of $q\not\equiv 1\mod{p}$, there is a positive proportion of imaginary quadratic fields $F/\mathbb{F}_q(T)$ with the property that $λ_p(F)\geq r$. The main result is proved as a consequence of recent unconditional theorems of Ellenberg-Venkatesh-Westerland on the distribution of class groups of imaginary quadratic function fields.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Anwesh Ray. 2023-03-06. On large Iwasawa $λ$-invariants of imaginary quadratic function fields. https://doi.org/10.1007/s11139-023-00717-1

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