The graph of atomic divisors and constructive recognition of finite simple groups

Abstract

The spectrum $\omega (G)$ of a finite group $G$ is the set of orders of elements of $G$. We present a polynomial-time algorithm that, given a finite set $\mathcal{M}$ of positive integers, outputs either an empty set or a finite simple group $G$. In the former case, there is no finite simple group $H$ with $\mathcal{M}=\omega (H)$, while in the latter case, $\mathcal{M}\subseteq \omega (G)$ and $\mathcal{M}\ne \omega (H)$ for all finite simple groups $H$ with $\omega (H)\ne \omega (G)$.

References in corpus (5)

• An adjacency criterion for the prime graph of a finite simple group
• Cocliques of maximal size in the prime graph of a finite simple group
• On finite groups isospectral to simple classical groups
• On the structure of finite groups isospectral to finite simple groups
• Primitive prime divisors and the $n$-th cyclotomic polynomial