SearcharxivSearch

arXiv · 2009.07490

A New Characterization of Sporadic Groups

Abstract

Let $G$ be a finite group, $n$ a positive integer. $\pi(n)$ denotes the set of all prime divisors of $n$ and $\pi(G)=\pi(|G|)$. The prime graph $\Gamma(G)$ of $G$, defined by Grenberg and Kegel, is a graph whose vertex set is $\pi(G)$, two vertices $p,\ q$ in $\pi(G)$ joined by an edge if and only if $G$ contains an element of order $pq$. In this article, a new characterization of sporadic simple groups is obtained, that is, if $G$ is a finite group and $S$ a sporadic simple group. Then $G\cong S$ if and only if $|G|=|S|$ and $\Gamma(G)$ is disconnected. This characterization unifies the several characterizations that can conclude the group has non-connected prime graphs, hence several known characterizations of sporadic simple groups become the corollaries of this new characterization.

Explore related subjects

Keep this discovery

BibTeXRIS

Zhongbi Wang, Heng Lv, Yanxiong Yan, Guiyun Chen. 2020-09-16. A New Characterization of Sporadic Groups. https://arxiv.org/abs/2009.07490

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