SearcharxivSearch

arXiv · 2109.09355

Galois trees in the graph of $p$-groups of maximal class

Abstract

The investigation of the graph $\mathcal{G}_p$ associated with the finite $p$-groups of maximal class was initiated by Blackburn (1958) and became a deep and interesting research topic since then. Leedham-Green and McKay (1976-1984) introduced skeletons of $\mathcal{G}_p$, described their importance for the structural investigation of $\mathcal{G}_p$ and exhibited their relation to algebraic number theory. Here we go one step further: we partition the skeletons into so-called Galois trees and study their general shape. In the special case $p \geq 7$ and $p \equiv 5 \bmod 6$, we show that they have a significant impact on the periodic patterns of $\mathcal{G}_p$ conjectured by Eick, Leedham-Green, Newman and O'Brien (2013). In particular, we use Galois trees to prove a conjecture by Dietrich (2010) on these periodic patterns.

Explore related subjects

Keep this discovery

BibTeXRIS

Alexander Cant, Heiko Dietrich, Bettina Eick, Tobias Moede. 2021-09-20. Galois trees in the graph of $p$-groups of maximal class. https://arxiv.org/abs/2109.09355

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