Search arXivSearch

arXiv · 2605.01590

3-class field towers with 2 or 3 stages

Abstract

For quadratic fields \(k=\mathbb{Q}(\sqrt{d})\) with discriminant \(d\), \(3\)-class group \(\mathrm{Cl}_3(k)\simeq (\mathbb{Z}/3\mathbb{Z})^2\), and four \textit{simple} \(3\)-principalization types \(\varkappa(k)\in\lbrace (1122),(3122),(1231),(2231)\rbrace\), we establish necessary and sufficient conditions for the Galois group \(S=\mathrm{Gal}(\mathrm{F}_3^\infty(k)/k)\) of the unramified Hilbert \(3\)-class field tower of \(k\) to coincide with the Galois group \(M=\mathrm{Gal}(\mathrm{F}_3^2(k)/k)\) of the maximal metabelian unramified \(3\)-extension of \(k\). In the case of non-coincidence, we study the path between \(M\) and \(S\) in the descendant tree of the elementary bicyclic \(3\)-group \((\mathbb{Z}/3\mathbb{Z})^2\). For two \textit{complex} \(3\)-principalization types \(\varkappa(k)\in\lbrace (2122),(4231)\rbrace\), we show that infinitely many non-metabelian possible Galois groups \(S=\mathrm{Gal}(\mathrm{F}_3^\infty(k)/k)\) with presumably unbounded derived length \(\mathrm{dl}(S)\) share a common metabelianization \(M=S/S^{\prime\prime}\), whence only partial criteria can be stated. Minimal discriminants \(d>0\) with assigned simple \(3\)-principalization type \(\varkappa(k)\) and fixed length \(\ell_3(k)\in\lbrace 2,3\rbrace\) of the \(3\)-class field tower are determined experimentally for nilpotency class \(\mathrm{cl}(M)\in\lbrace 5,7,9,11\rbrace\) under assumption of the generalized Riemann hypothesis.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Helga Boyer von Berghof, Daniel C. Mayer. 2026-05-02. 3-class field towers with 2 or 3 stages. https://arxiv.org/abs/2605.01590

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