Search arXivSearch

arXiv · 1508.06552

On Hilbert $2$-class fields and $2$-towers of imaginary quadratic number fields

Abstract

Inspired by the Odlyzko root discriminant and Golod--Shafarevich $p$-group bounds, Martinet (1978) asked whether an imaginary quadratic number field $K/\mathbb{Q}$ must always have an infinite Hilbert $2$-class field tower when the class group of $K$ has $2$-rank $4$, or equivalently when the discriminant of $K$ has $5$ prime factors. No negative results are known. Benjamin (2001, 2002) and Sueyoshi (2004, 2009, 2010) systematically established infinite $2$-towers for many $K$ in question, by casework on the associated Rédei matrices. Others, notably Mouhib (2010), have also made progress, but still many cases remain open, especially when the the class group of $K$ has small $4$-rank. Recently, Benjamin (2015) made partial progress on several of these open matrices when the class group of $K$ has $4$-rank $1$ or $2$. In this paper, we partially address many open cases when the $4$-rank is $0$ or $2$, affirmatively answering some questions of Benjamin. We then investigate barriers to our methods and ask an extension question (of independent interest) in this direction. Finally, we suggest places where speculative refinements of Golod--Shafarevich or group classification methods might overcome the `near miss' inadequacies in current methods.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Victor Y. Wang. 2015-11-09. On Hilbert $2$-class fields and $2$-towers of imaginary quadratic number fields. https://doi.org/10.1016/j.jnt.2015.09.022

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