Some simple groups which are determined by their orders and degree-patterns
Let \(G\) be a finite group and \(\mathrm{Irr}(G)\) the set of all irreducible complex characters of \(G\). Let \(\mathrm{cd}(G)=\{ \chi(1) \mid \chi \in \mathrm{Irr}(G) \}\) be the set of all irreducible complex character degrees of \(G\) and let \(\rho(G)=\bigcup_{\chi \in \mathrm{Irr}(G)} \pi(\chi(1))\) be the set of all primes which divide some character degree of \(G\). The character-prime graph \(\Gamma(G)\) associated to \(G\) is the simple undirected graph whose vertex set is \(\rho(G)\) and there is an edge between two distinct primes \(p\) and \(q\) if and only if \(p,q \in \pi(\chi(1))\) for some \(\chi \in \mathrm{Irr}(G)\). If \(d_{G}(p)\) is the degree of a vertex \(p\) in \(\Gamma(G)\), the degree-pattern of \(G\) is defined as \(D(G)=\big (d_{G}(p_{1}1),d_{G}(p_{2}), \dots d_{G}(p_{k}) \big)\) with \(\rho(G)=\{p_{1}, p_{2}, \dots p_{k} \}\) and \(p_{1} < p_{2} < \dots < p_{k}\). The main results in the paper under review are the following: Theorem 3.2. Let \(G\) be a finite group and \(S\) be one of the following finite nonabelian simple groups: \(L_{3}(3)\) and \(U_{3}(4)\). Then \(G \simeq S\) if and only if \(|G|=|S|\) and \(D(G)=D(S)\). Theorem 3.3: Let \(G\) be a finite group and \(S\) be one of the following finite nonabelian simple groups: \(A_{7}\), \(J_{1}\), \(J_{3}\) and \(J_{4}\). Then \(G \simeq S\) if and only if \(|G|=|S|\) and \(\rho(G)=\pi(G)\). The authors point out that if \(S\) is a simple group and \(G\) is a group such that \(|G|=|S|\), then \(D(G)=D(S)\) implies \(\pi(G)=\rho(G)\), but the reverse is generally not true (see [\textit{D. L. White}, Rocky Mt. J. Math. 39, No. 5, 1713--1739 (2009; Zbl 1180.20008)]). For example, \(\rho(Z_{12} \times L_{2}(11))=\rho(M_{11})=\{2,3,5,11 \}\) and \(|Z_{12} \times L_{2}(11)|=|M_{11}|\), but \(D(Z_{12} \times L_{2}(11))=(2,1,1,0)\) and \(D(M_{11})=(2,1,3,2)\).
- Recognition of some simple groups by character degree graph and order
- Some simple groups which are determined by their character degree graphs
- A quantitative characterization of some finite simple groups through order and degree pattern.
- Recognizing Finite Groups Through Order and Degree Pattern
- Recognition by character degree graph and order of the simple groups of order less than 6000.
This page was built for publication: Some simple groups which are determined by their orders and degree-patterns
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6546522)