SearcharxivSearch

arXiv · 1301.2112

The number of profinite groups with a specified Sylow subgrou

Abstract

Let $S$ be a finitely generated pro-$p$ group. Let $\Emb(S)$ be the class of profinite groups $G$ that have $S$ as a Sylow subgroup, and such that $S$ intersects non-trivially with every non-trivial normal subgroup of $G$. In this paper, we investigate the question of whether or not $\Emb(S)$ has finitely many isomorphism classes. For instance, we give an example where $\Emb(S)$ contains an infinite ascending chain of soluble groups, and on the other hand show that $\Emb(S)$ contains only finitely many isomorphism classes in the case that $S$ is just infinite.

Explore related subjects

Keep this discovery

BibTeXRIS

Colin D. Reid. 2013-01-10. The number of profinite groups with a specified Sylow subgrou. https://arxiv.org/abs/1301.2112

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