Recognition of the group $E_{6}(5)$ by prime graph

Document Type : Research Paper

Author

Department of Mathematics Education, Farhangian University , P.O.Box 14665-889, Tehran, Iran

10.22108/msci.2025.144850.1736

Abstract

If \( n \) is an integer, the set of all prime divisors of \( n \) is denoted by \( \pi(n) \). Let \( G \) be a finite group. Then \( \pi(|G|) \) is denoted by \( \pi(G) \). The prime graph of \( G \), denoted by \( \Gamma(G) \), is constructed as follows: the vertex set is \( \pi(G) \), and two distinct primes \( p \) and \( q \) are connected by an edge if and only if \( G \) has an element of order \( pq \). A finite nonabelian simple group $P$ is called quasirecognizable by prime graph, if each finite group $G$ with $\Gamma(G) = \Gamma(P)$ has a unique composition factor isomorphic to $P$. We denote by $k(\Gamma(G))$ the number of isomorphism classes of finite groups $H$ satisfying $\Gamma(G)=\Gamma(H)$. Given a natural number $r$, a finite group $G$ is called $r$-recognizable by prime graph if $k(\Gamma(G))=r$ and if $k(\Gamma(G))=1$, is called recognizable . In this paper, as the main result, we show that if \( G \) is a finite group such that \( \Gamma(G) = \Gamma(E_6(5)) \), then \( G \cong E_6(5) \).

Keywords

Main Subjects

References

[1] R. W. Carter, Simple groups of Lie type, Pure and Applied Mathematics, 28, John Wiley & Sons, London-New York-Sydney, 1972.
[2] J. H. Conway, R. T. Curtis, S. P. Norton, R. A. Parker and R. A. Wilson, ATLAS of finite groups, Maximal subgroups and ordinary characters for simple groups, With computational assistance from J. G. Thackray, Oxford University Press, Eynsham, 1985.
[3] D. Gorenstein, Finite groups, Harper & Row, Publishers, New York-London, 1968.
[4] W. Guo, A. S. Kondrat’ev and N. V. Maslova, Recognition of the group E6(2) by Grunberg-Kegel graph, Tr. Inst. Mat. Mekh., 27 no. 4 (2021) 263–268.
[5] R. M. Guralnick and P. H. Tiep, Finite simple unisingular groups of Lie type, J. Group Theory, 6 no. 3 (2003) 271–310.
[6] W. M. Kantor and A. Seress, Prime power graphs for groups of Lie type, J. Algebra, 247 no. 2 (2002) 370–434.
[7] A. Khosravi and B. Khosravi, Quasirecognition of the simple group 2G2(q) by a prime graph, Siberian Math. J., 48 no. 3 (2007) 570–577.
[8] B. Khosravi, n-recognition by prime graph of the simple group PSL(2, q), J. Algebra Appl., 7 no. 6 (2008) 735–748.
[9] B. Khosravi, Quasirecognizability of L10(2) by a prime graph, Sib. Math. J., 50 no. 2 (2009) 355–359.
[10] B. Khosravi, Some characterizations of L9(2) related to its prime graph, Publ. Math. Debrecen, 75 no. 3-4 (2009) 375–385.
[11] B. Khosravi, B. Khosravi and B. Khosravi, On the prime graph of PSL(2, p) where p > 3 is a prime number, Acta Math. Hungar., 116 no. 4 (2007) 295–307.
[12] A. Khosravi and B. Khosravi, 2-recognizability of PSL(2, p2) by a prime graph, Sib. Math. J., 49 no. 4 (2008) 749–757.
[13] B. Khosravi, B. Khosravi and B. Khosravi, A characterization of the finite simple group L16(2) by its prime graph, Manuscripta Math., 126 no. 1 (2008) 49–58.
[14] B. Khosravi and H. Moradi, Quasirecognition by prime graph of some orthogonal groups over the binary field, J. Algebra Appl., 11 no. 3 (2012) 1250056, 15 pp.
[15] A. P. Khramova, N. V. Maslova, V. V. Panshin and A. M. Staroletov, Characterization of groups E6(3) and 2E6(3) by Gruenberg-Kegel graph, Sib. Èlektron. Mat. Izv., 18 no. 2 (2021) 1651–1656.
[16] A. S. Kondrat’ev, Recognizability by a prime graph of the group 2E6(2), J. Math. Sci., New York, 259 no. 4 (2021) 463–466.
[17] M. W. Liebeck, J. Saxl and G. M. Seitz, Subgroups of maximal rank in finite exceptional groups of Lie type, Proc. London Math. Soc. (3), 65 no. 2 (1992) 297–325.
[18] Z. Momen and B. Khosravi, On r-recognition by prime graph of Bp(3) where p is an odd prime, Monatsh. Math., 166 no. 2 (2012) 239–253.
[19] Z. Momen and B. Khosravi, Groups with the same prime graph as the orthogonal group Bn(3), Sib. Math. J., 54 no. 3 (2013) 487–500.
[20] Z. Momen and B. Khosravi, Groups with the same orders of maximal abelian subgroups as A2(q), Monatsh. Math., 174 no. 2 (2014) 285–303.
[21] Z. Momen and B. Khosravi, Quasirecognition of E6(q) by the orders of maximal abelian subgroups, J. Algebra Appl., 17 no. 7 (2018) 1850122, 14 pp.
[22] Z. Momen and B. Khosravi, On the recognizability of the groups PSU3(q) by the orders of maximal abelian subgroups, Sib. Math. J., 60 no. 1 (2019) 124–139.
[23] A. M. Staroletov, On recognition of alternating groups by prime graph, Sib. Èlektron. Mat. Izv., 14 (2017) 994–1010.
[24] A. V. Vasil’ev, On a relation between the structure of a finite group and the properties of its prime graph, Siberian Math. J., 46 no. 3 (2005) 396–404.
[25] A. V. Vasil’ev and E. P. Vdovin, An adjacency criterion in the prime graph of a finite simple group, Algebra Logic, 44 no. 6 (2005) 381–406.
[26] A. V. Zavarnitsin, On the recognition of finite groups by the prime graph, Algebra Logic, 43 no. 4 (2006) 220–231.
[27] A. V. Zavarnitsine, Finite simple groups with narrow prime spectrum, Sib. Èlektron. Mat. Izv., 6 (2009) 1–12.
[28] A. V. Zavarnitsine, Finite groups with a five-component prime graph, Sib. Math. J., 54 no. 1 (2013) 40–46.

Files

History

  • Receive Date: 07 April 2025
  • Revise Date: 08 September 2025
  • Accept Date: 21 December 2025
  • Publish Date: 11 January 2026

Share

How to cite

Statistics