SearcharxivSearch

arXiv · 2402.03673

Generation by conjugate elements of finite almost simple groups with a sporadic socle

Abstract

As defined by Guralnick and Saxl given a nonabelian simple group $S$ and its nonidentity automorphism $x$, a natural number $\alpha_S(x)$ does not exceed a natural number $m$ if some $m$ conjugates of $x$ in the group $\langle x,S\rangle$ generate a subgroup that includes $S$. The outcome of this paper together with one by Di Martino, Pellegrini, and Zalesski, both of which are based on computer calculations with character tables, is a refinement of the estimates by Guralnick and Saxl on the value of $\alpha_S(x)$ in the case where $S$ is a sporadic group. In particular, we prove that $\alpha_S(x)\leqslant 4$, except when $S$ is one of the Fischer groups and $x$ is a $3$-transposition. In the latter case, $\alpha_S(x)=6$ if $S$ is either $Fi_{22}$ or $Fi_{23}$ and $\alpha_S(x)=5$ if $S={Fi_{24}}'$.

Explore related subjects

Keep this discovery

BibTeXRIS

Danila O. Revin, Andrei V. Zavarnitsine. 2024-02-06. Generation by conjugate elements of finite almost simple groups with a sporadic socle. https://doi.org/10.26516/1997-7670.2024.49.135

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