SearcharxivSearch

arXiv · 1409.8086

On the structure of finite groups isospectral to finite simple groups

Abstract

Finite groups are said to be isospectral if they have the same sets of element orders. A finite nonabelian simple group $L$ is said to be almost recognizable by spectrum if every finite group isospectral to $L$ is an almost simple group with socle isomorphic to $L$. It is known that all finite simple sporadic, alternating and exceptional groups of Lie type, except $J_2$, $A_6$, $A_{10}$ and $^3D_4(2)$, are almost recognizable by spectrum. The present paper is the final step in the proof of the following conjecture due to V.D. Mazurov: there exists a positive integer $d_0$ such that every finite simple classical group of dimension larger than $d_0$ is almost recognizable by spectrum. Namely, we prove that a nonabelian composition factor of a~finite group isospectral to a finite simple symplectic or orthogonal group $L$ of dimension at least 10, is either isomorphic to $L$ or not a group of Lie type in the same characteristic as $L$, and combining this result with earlier work, we deduce that Mazurov's conjecture holds with $d_0=60$.

Explore related subjects

Keep this discovery

BibTeXRIS

Mariya A. Grechkoseeva, Andrey V. Vasil'ev. 2015-06-23. On the structure of finite groups isospectral to finite simple groups. https://doi.org/10.1515/jgth-2015-0019

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