Search arXivSearch

arXiv · 1807.04916

A note on asymptotic class number upper bounds in $p$-adic Lie extensions

Abstract

Let $p$ be an odd prime and $F_{\infty}$ a $p$-adic Lie extension of a number field $F$ with Galois group $G$. Suppose that $G$ is a compact pro-$p$ $p$-adic Lie group with no torsion and that it contains a closed normal subgroup $H$ such that $G/H\cong \mathbb{Z}_p$. Under various assumptions, we establish asymptotic upper bounds for the growth of $p$-exponents of the class groups in the said $p$-adic Lie extension. Our results generalize a previous result of Lei, where he established such an estimate under the assumption that $H\cong \mathbb{Z}_p$.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Meng Fai Lim. 2018-07-13. A note on asymptotic class number upper bounds in $p$-adic Lie extensions. https://doi.org/10.1007/s10114-019-8410-9

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