SearcharxivSearch

arXiv · 1506.03630

Recognizing by Spectrum for the Automorphism Groups of Sporadic Simple Groups

Abstract

The spectrum of a finite group is the set of its element orders, and two groups are said to be isospectral if they have the same spectra. A finite group $G$ is said to be recognizable by spectrum, if every finite group isospectral with $G$ is isomorphic to $G$. We prove that if $S$ is any of the sporadic simple groups $M^cL$, $M_{12}$, $M_{22}$, $He$, $Suz$, $O'N$, then ${\rm Aut}(S)$ is recognizable by spectrum. This finishes the proof of the recognizability by spectrum of the automorphism groups of all sporadic simple groups, except $J_2$. Furthermore, we show that if $G$ is isospectral with ${\rm Aut}(J_2)$, then either $G$ is isomorphic to ${\rm Aut}(J_2)$, or $G$ is an extension of a $2$-group by $\mathbb{A}_8$.

Explore related subjects

Keep this discovery

BibTeXRIS

Victor Danilovich Mazurov, Alireza Moghaddamfar. 2015-06-11. Recognizing by Spectrum for the Automorphism Groups of Sporadic Simple Groups. https://arxiv.org/abs/1506.03630

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