Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · math/0602364

Maximal unramified 3-extensions of imaginary quadratic fields and SL_2(Z_3)

L. Bartholdi·M. R. Bush
View original source ↗Read source document ↗Export metadata ↓

Abstract

The structure of the Galois group of the maximal unramified p-extension of an imaginary quadratic field is restricted in various ways. In this paper we construct a family of finite 3-groups satisfying these restrictions. We prove several results about this family and characterize them as finite extensions of certain quotients of a Sylow pro-3 subgroup of SL_2(Z_3). We verify that the first group in the family does indeed arise as such a Galois group and provide a small amount of evidence that this may hold for the other members. If this were the case then it would imply that there is no upper bound on the possible lengths of a finite p-class tower.

Explore related subjects

math.NTmath.GR

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

L. Bartholdi, M. R. Bush. 2006-02-16. Maximal unramified 3-extensions of imaginary quadratic fields and SL_2(Z_3). https://doi.org/10.1016/j.jnt.2006.08.008

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

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↗
arXiv2026

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↗