SearcharxivSearch

arXiv · 1310.6518

Boosting an analogue of Jordan's theorem for finite groups

Abstract

Let $\mathcal C$ be a set of finite groups which is closed under taking subgroups and let $d$ and $M$ be positive integers. Suppose that for any $G\in\mathcal C$ whose order is divisible by at most two distinct primes there exists an abelian subgroup $A\subseteq G$ such that $A$ is generated by at most $d$ elements and $[G : A] \le M$. We prove that there exists a positive constant $C_0$ such that any $G \in \mathcal C$ has an abelian subgroup $A$ satisfying $[G : A] \le C_0$, and $A$ can be generated by at most $d$ elements. We also prove some related results. Our proofs use the Classification of Finite Simple Groups.

Explore related subjects

Keep this discovery

BibTeXRIS

Ignasi Mundet i Riera, Alexandre Turull. 2014-01-10. Boosting an analogue of Jordan's theorem for finite groups. https://arxiv.org/abs/1310.6518

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