Searcharxiv⌕ Search
Home/Archive/arXiv

arXiv · 1906.00416

The strategy of pattern recognition via Artin transfers applied to finite towers of 2-class fields

Daniel C. Mayer
View original source ↗Read source document ↗Export metadata ↓

Abstract

The isomorphism type of the Galois group of the 2-class field tower of quadratic number fields having a 2-class group with abelian type invariants (4,4) is determined by means of information on the transfer of 2-classes to unramified abelian 2-extensions, collected in the Artin pattern. In recent investigations by Benjamin and Snyder, the length of the tower of such fields has turned out to be dependent on the rank of the 2-class group of the first Hilbert 2-class field. Significant progress is achieved by extending the pool of possible metabelian 2-groups of the second Hilbert 2-class field from the SmallGroups database, resp. Hall-Senior classification, with the aid of the p-group generation algorithm, and sifting the pool by means of pattern recognition.

Explore related subjects

math.GRmath.NT

Keep this discovery

BibTeXRIS

Daniel C. Mayer. 2019-06-02. The strategy of pattern recognition via Artin transfers applied to finite towers of 2-class fields. https://arxiv.org/abs/1906.00416

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

KEEP EXPLORING

Related papers

arXiv2026

Reversibility and its asymptotic counting in Picard group

We investigate reversible elements in the Picard modular group $\mathrm{PSL}(2,\mathbb{Z}[i])$. We show that reversibility coincides with strong reversibility for Kleinian groups, in particular for the Picard group. We classify reversible elements in the Picard group and characterize loxodromic reversible elements up to conjugacy. We prove that each such conjugacy class contains exactly eight special representatives. We also obtain asymptotic estimates for the number of reversible conjugacy classes with bounded trace.

math.GR↗
arXiv2026

Conjugator length in finitely generated groups

We describe all functions $\mathbb{N}\rightarrow \mathbb{N}$ that can be realized, up to the standard equivalence, as conjugator length functions of finitely generated groups. Furthermore, we show that any two increasing functions $f,g\colon \mathbb N\to \mathbb N$ can be simultaneously realized as conjugator length functions of finitely generated, commensurable (in particular, quasi-isometric) groups.

math.GR↗
arXiv2026

The spectrum of conjugator length functions

A recent program tries to find which functions appear as conjugator length functions. In this note, we show that any (computable) increasing function larger than $n$ appears as $\mathrm{Cl}_G$ for some finitely generated (recursively presented) group. On the other hand, we demonstrate that either $\mathrm{Cl}_G$ must be constant or $\mathrm{Cl}_G(n)\succ n$. Combining these, we obtain a complete description of which functions appear as conjugator length functions of finitely generated groups.

math.GR↗