SearcharxivSearch

arXiv · 1508.02274

Combinatorial Techniques in the Galois Theory of $p$-Extensions

Abstract

A major open problem in current Galois theory is to characterize those profinite groups which appear as absolute Galois groups of various fields. Obtaining detailed knowledge of the structure of quotients and subgroup filtrations of Galois groups of $p$-extensions is an important step toward a solution. We illustrate several techniques for counting Galois $p$-extensions of various fields, including pythagorean fields and local fields. An expression for the number of extensions of a formally real pythagorean field having Galois group the dihedral group of order 8 is developed. We derive a formula for computing the $\mathbb{F}_p$-dimension of an $n$-th graded piece of the Zassenhaus filtration for various finitely generated pro-$p$ groups, including free pro-$p$ groups, Demushkin groups and their free pro-$p$ products. Several examples are provided to illustrate the importance of these dimensions in characterizing pro-$p$ Galois groups. We also show that knowledge of small quotients of pro-$p$ Galois groups can provide information regarding the form of relations among the group generators.

Explore related subjects

Keep this discovery

BibTeXRIS

Michael L. Rogelstad. 2015-08-10. Combinatorial Techniques in the Galois Theory of $p$-Extensions. https://arxiv.org/abs/1508.02274

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

KEEP EXPLORING

Related papers

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

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

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