RECORD
Recognisability of the sporadic groups by the isomorphism types of their prime graphs
Group Theory · Submitted 16 Oct 2023
abstract compiled · 2026-09-23 · no language-model review
The authors' main claim Here we determine which of the sporadic finite simple groups are recognisable by the isomorphism types of their prime graphs.
The compiled record
The paper's own sentences, arranged. Each label is drawn from a closed vocabulary; the number beside it is the probability the classifier gave that label. Numbers in the tables are the authors', checked by code. No sentence in this record was written by a model.
Open the compiled record
The abstract, sentence by sentence
The prime graph of a finite group $G$ is the labelled graph $\Gamma(G)$ with vertices the prime divisors of $|G|$ and edges the pairs $\{p,q\}$ for which $G$ contains an element of order $pq$. A group $G$ is recognisable by its prime graph if every group $H$ with $\Gamma(H)=\Gamma(G)$ is isomorphic to $G$. Cameron and Maslova have shown that every group that is recognisable by its prime graph is almost simple, which justifies the significant amount of attention that has been given to determining which simple (or almost simple) groups are recognisable by their prime graphs. This problem has been completely solved for certain families of simple groups, including the sporadic groups. A natural extension of the problem is to determine which groups are recognisable by their unlabelled prime graphs, i.e. by the isomorphism types of their prime graphs. There seem to be only very limited results in this direction in the literature. Here we determine which of the sporadic finite simple groups are recognisable by the isomorphism types of their prime graphs. We also show that for every sporadic group $G$ that is not recognisable by the isomorphism type of $\Gamma(G)$, there are infinitely many groups $H$ with $\Gamma(H) \cong \Gamma(G)$.
background contribution method result interpretation main claim
| # | sentence | role | the authors' own work | states the main conclusion | strength |
|---|---|---|---|---|---|
| s0 | The prime graph of a finite group $G$ is the labelled graph $\Gamma(G)$ with vertices the prime divisors of $|G|$ and edges the pairs $\{p,q\}$ for which $G$ contains an element of order $pq$. | background 1.00 | 0.06 | 0.02 | asserted 0.99 |
| s1 | A group $G$ is recognisable by its prime graph if every group $H$ with $\Gamma(H)=\Gamma(G)$ is isomorphic to $G$. | background 1.00 | 0.06 | 0.03 | asserted 0.96 |
| s2 | Cameron and Maslova have shown that every group that is recognisable by its prime graph is almost simple, which justifies the significant amount of attention that has been given to determining which simple (or almost simple) groups are recognisable by their prime graphs. | background 1.00 | 0.03 | 0.03 | asserted 1.00 |
| s3 | This problem has been completely solved for certain families of simple groups, including the sporadic groups. | background 0.97 | 0.04 | 0.04 | asserted 1.00 |
| s4 | A natural extension of the problem is to determine which groups are recognisable by their unlabelled prime graphs, i.e. by the isomorphism types of their prime graphs. | background 0.60 | 0.06 | 0.04 | asserted 0.85 |
| s5 | There seem to be only very limited results in this direction in the literature. | gap 0.97 | 0.06 | 0.02 | hedged possibility 0.81 |
| s6 | Here we determine which of the sporadic finite simple groups are recognisable by the isomorphism types of their prime graphs. | contribution 0.99 | 0.97 | 0.36 | asserted 1.00 |
| s7 | We also show that for every sporadic group $G$ that is not recognisable by the isomorphism type of $\Gamma(G)$, there are infinitely many groups $H$ with $\Gamma(H) \cong \Gamma(G)$. | result 0.98 | 0.96 | 0.46 | asserted 1.00 |
What was examined, and what was not
- arXiv listing abstract v3
- full text
- figures and tables
- references and citing sentences
- relations to other papers
- P abstract
- S sections
- T body sentences
- C citations
- R cross-paper relations
The paper
Original abstract
The prime graph of a finite group $G$ is the labelled graph $\Gamma(G)$ with vertices the prime divisors of $|G|$ and edges the pairs $\{p,q\}$ for which $G$ contains an element of order $pq$. A group $G$ is recognisable by its prime graph if every group $H$ with $\Gamma(H)=\Gamma(G)$ is isomorphic to $G$. Cameron and Maslova have shown that every group that is recognisable by its prime graph is almost simple, which justifies the significant amount of attention that has been given to determining which simple (or almost simple) groups are recognisable by their prime graphs. This problem has been completely solved for certain families of simple groups, including the sporadic groups. A natural extension of the problem is to determine which groups are recognisable by their unlabelled prime graphs, i.e. by the isomorphism types of their prime graphs. There seem to be only very limited results in this direction in the literature. Here we determine which of the sporadic finite simple groups are recognisable by the isomorphism types of their prime graphs. We also show that for every sporadic group $G$ that is not recognisable by the isomorphism type of $\Gamma(G)$, there are infinitely many groups $H$ with $\Gamma(H) \cong \Gamma(G)$.
Human review
References
How the literature uses it
What this paper does with the arXiv papers it cites
Discussion
Know something about this paper? Leave a comment, or highlight any passage above to comment on it.