Trudy Instituta Matematiki i Mekhaniki UrO RAN
RUS  ENG    JOURNALS   PEOPLE   ORGANISATIONS   CONFERENCES   SEMINARS   VIDEO LIBRARY   PACKAGE AMSBIB  
General information
Latest issue
Archive
Impact factor

Search papers
Search references

RSS
Latest issue
Current issues
Archive issues
What is RSS



Trudy Inst. Mat. i Mekh. UrO RAN:
Year:
Volume:
Issue:
Page:
Find






Personal entry:
Login:
Password:
Save password
Enter
Forgotten password?
Register


Trudy Instituta Matematiki i Mekhaniki UrO RAN, 2019, Volume 25, Number 4, Pages 79–87
DOI: https://doi.org/10.21538/0134-4889-2019-25-4-79-87
(Mi timm1672)
 

This article is cited in 3 scientific papers (total in 3 papers)

Recognition of the Sporadic Simple Groups $Ru,\ HN,\ Fi_{22},\ He,\ M^cL$, and $Co_3$ by Their Gruenberg–Kegel Graphs

A. S. Kondrat'ev

Institute of Mathematics and Mechanics, Ural Branch of the Russian Academy of Sciences, Ekaterinburg
Full-text PDF (208 kB) Citations (3)
References:
Abstract: The Gruenberg–Kegel graph (prime graph) $\Gamma(G)$ of a finite group $G$ is a graph in which the vertices are the prime divisors of the order of $G$ and two distinct vertices $p$ and $q$ are adjacent if and only if $G$ contains an element of order $pq$. The problem of recognition of finite groups by their Gruenberg–Kegel graph is of great interest in finite group theory. For a finite group $G$, $h_{\Gamma}(G)$ denotes the number of all pairwise nonisomorphic finite groups $H$ such that $\Gamma(H)=\Gamma(G)$ (if the set of such groups $H$ is infinite, then $h_{\Gamma}(G)=\infty$). A group $G$ is called $n$-recognizable by its Gruenberg–Kegel graph if $h_{\Gamma}(G)=n<\infty$, recognizable by its Gruenberg–Kegel graph if $h_{\Gamma}(G)=1$, and unrecognizable by its Gruenberg–Kegel graph if $h_{\Gamma}(G)=\infty$. We say that the problem of recognition by the Gruenberg–Kegel graph is solved for a finite group $G$ if the value $h_{\Gamma}(G)$ is found. For a finite group $G$ unrecognizable by its Gruenberg–Kegel graph, the question of the (normal) structure of finite groups having the same Gruenberg–Kegel graph as $G$ is also of interest. In 2003, M. Hagie investigated the structure of finite groups having the same Gruenberg–Kegel graph as some sporadic simple groups. In particular, she gave first examples of finite groups recognizable by their Gruenberg–Kegel graphs; they were the sporadic simple groups $J_1$, $M_{22}$, $M_{23}$, $M_{24}$, and $Co_2$. However, that investigation was not completed. In 2006, A.V. Zavarnitsine established that the group $J_4$ is recognizable by its Gruenberg–Kegel graph. The unrecognizability of the sporadic groups $M_{12}$ and $J_2$ by their Gruenberg–Kegel graph was known previously; it follows from the unrecognizability of these groups by their spectrum. In the present paper, we continue Hagie's study and use her results. For any sporadic simple group $S$ isomorphic to $Ru$, $HN$, $Fi_{22}$, $He$, $M^cL$, or $Co_3$, we find all finite groups having the same Gruenberg–Kegel graph as $S$. Thus, for these six groups, we complete Hagie's investigation and, in particular, solve the problem of recognizability by the Gruenberg–Kegel graph.
Keywords: finite group, simple group, sporadic group, spectrum, Gruenberg–Kegel graph, recognition by the Gruenberg–Kegel graph.
Received: 30.09.2019
Revised: 19.11.2019
Accepted: 21.11.2019
English version:
Proceedings of the Steklov Institute of Mathematics (Supplementary issues), 2021, Volume 313, Issue 1, Pages S125–S132
DOI: https://doi.org/10.1134/S0081543821030135
Bibliographic databases:
Document Type: Article
UDC: 512.542
Language: Russian
Citation: A. S. Kondrat'ev, “Recognition of the Sporadic Simple Groups $Ru,\ HN,\ Fi_{22},\ He,\ M^cL$, and $Co_3$ by Their Gruenberg–Kegel Graphs”, Trudy Inst. Mat. i Mekh. UrO RAN, 25, no. 4, 2019, 79–87; Proc. Steklov Inst. Math. (Suppl.), 313, suppl. 1 (2021), S125–S132
Citation in format AMSBIB
\Bibitem{Kon19}
\by A.~S.~Kondrat'ev
\paper Recognition of the Sporadic Simple Groups $Ru,\ HN,\ Fi_{22},\ He,\ M^cL$, and $Co_3$ by Their Gruenberg--Kegel Graphs
\serial Trudy Inst. Mat. i Mekh. UrO RAN
\yr 2019
\vol 25
\issue 4
\pages 79--87
\mathnet{http://mi.mathnet.ru/timm1672}
\crossref{https://doi.org/10.21538/0134-4889-2019-25-4-79-87}
\elib{https://elibrary.ru/item.asp?id=41455523}
\transl
\jour Proc. Steklov Inst. Math. (Suppl.)
\yr 2021
\vol 313
\issue , suppl. 1
\pages S125--S132
\crossref{https://doi.org/10.1134/S0081543821030135}
\isi{https://gateway.webofknowledge.com/gateway/Gateway.cgi?GWVersion=2&SrcApp=Publons&SrcAuth=Publons_CEL&DestLinkType=FullRecord&DestApp=WOS_CPL&KeyUT=000501769500008}
\scopus{https://www.scopus.com/record/display.url?origin=inward&eid=2-s2.0-85078529529}
Linking options:
  • https://www.mathnet.ru/eng/timm1672
  • https://www.mathnet.ru/eng/timm/v25/i4/p79
  • This publication is cited in the following 3 articles:
    Citing articles in Google Scholar: Russian citations, English citations
    Related articles in Google Scholar: Russian articles, English articles
    Trudy Instituta Matematiki i Mekhaniki UrO RAN
     
      Contact us:
     Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2024