An answer to a question of Isaacs on character degree graphs.
Let \(G\) be a finite group. In recent years, there has been quite some activity studying character degree graphs of finite groups. One way of defining such a graph \(\Gamma(G)\) is to take as vertex set the set of prime divisors of the degrees of the irreducible (complex) characters of \(G\) and to join such primes \(p,q\) by an edge if \(pq\) divides the degree of an irreducible character of \(G\). \textit{I. M. Isaacs} [in Trans. Am. Math. Soc. 356, No. 3, 1155-1183 (2004; Zbl 1034.20009)] began the study of the relative character degree graph \(\Gamma(G|N)\) where \(N\) is normal in \(G\) and attention is restricted to the set \(\text{Irr}(G|N)=\{\chi\in\text{Irr}(G)\mid N\not\leq\ker\chi\}\). The paper under review answers an open question of Isaacs' paper by proving the following Theorem. Let \(N\) be a normal subgroup of \(G\) with \(N\leq G'\). If \(\Gamma(G|N)\) is disconnected, then \(G/N\) is solvable. -- The proof depends on CFSG. By Isaacs' work, only the case that \(N\) is a nonabelian \(p\)-group has to be considered. Along the way, the author finishes work begun by \textit{R. J. Higgs} [Commun. Algebra 26, No. 10, 3133-3140 (1998; Zbl 0937.20002)] by proving the following Theorem. Let \(N\) be normal in \(G\) and let \(\varphi\in\text{Irr}(N)\) be \(G\)-invariant. Assume that \(\chi(1)/\varphi(1)\) is odd for all \(\chi\in\text{Irr}(G|\varphi)\). Then \(G/N\) is solvable.
- On the character degree graph of solvable groups. I: Three primes
- A note on character degrees of finite solvable groups
- On the character degree graph of solvable groups. II. Discon- nected graphs
- On prime character degree graphs occurring within a family of graphs
- A solvable group whose character degree graph has diameter 3
- Character degree graphs with no complete vertices.
- Character degree graphs, blocks and normal subgroups
- Regular character degree graphs.
- Four-vertex degree graphs of nonsolvable groups.
- Non-solvable groups whose character degree graph has a cut-vertex. I
- A finite simple group of Lie type has p-blocks with different defects, \(p\neq 2\)
- A Fixed-Point Theorem for Central Elements in Quasisimple Groups
- Brauer's height zero conjecture for central quotients of special linear and special unitary groups
- Character degree graphs and normal subgroups
- Connectedness of degree graphs of nonsolvable groups.
- Derived lengths of solvable groups having five irreducible character degrees. I.
- Groups whose Projective character degrees are powers of a prime
- scientific article; zbMATH DE number 3811825 (Why is no real title available?)
- scientific article; zbMATH DE number 3904833 (Why is no real title available?)
- scientific article; zbMATH DE number 3732316 (Why is no real title available?)
- scientific article; zbMATH DE number 479556 (Why is no real title available?)
- scientific article; zbMATH DE number 682077 (Why is no real title available?)
- In search of nonsolvable groups of central type
- Irreducible character degrees and normal subgroups
- Prime power degree representations of quasi-simple groups
- Prime Power Degree Representations of the Double Covers of the Symmetric and Alternating Groups
- Projective characters of odd degree
- Solvable groups whose degree graphs have two connected components
- Subgroups of prime power index in a simple group
- The characterization of finite groups with abelian Sylow 2-subgroups
- Thompson's problem (\(\sigma^2=3\)) With two appendices. I: The numerical verification of Thompson's identity by Andrew Odlyzko: II: A check of the Ree group conjecture for small fields by David Hunt
- Upper bounds for the number of conjugacy classes of a finite group
- An overview of graphs associated with character degrees and conjugacy class sizes in finite groups.
- On Huppert's conjecture for \(G_2(q)\), \(q\geq 7\).
- On Huppert's conjecture for ^3D₄(q), q 3.
- Extending Huppert's conjecture to almost simple groups of Lie type
- Brauer's height zero conjecture for the 2-blocks of maximal defect.
- GROUPS WITH THE SAME CHARACTER DEGREES AS SPORADIC ALMOST SIMPLE GROUPS
- Projective special linear groups \(\mathrm{PSL}_4(q)\) are determined by the set of their character degrees.
- Huppert's conjecture for alternating groups
- Characters of relative \(p^\prime\)-degree over normal subgroups
- Taketa's theorem for relative character degrees.
- Character degree graphs and normal subgroups
- Projective characters with prime power degrees
- Representation of finite groups: conjectures, reductions, and applications.
- Two applications of Lewis' theorem on character degree graphs of solvable groups.
- On Huppert's conjecture for alternating groups of low degrees.
- Finite groups with \(K_5\)-free prime graphs
- Disconnectedness and Diameters of Degree Graphs Associated with Normal Subgroups#
- Groups with the same character degrees as sporadic quasisimple groups
- Characterization of some almost simple groups with socle PSp4(q) by their character degrees
- The simple Ree groups ^2F₄(q^2) are determined by the set of their character degrees.
- Characters of relative \(\pi^{\prime}\)-degree over normal subgroups
This page was built for publication: An answer to a question of Isaacs on character degree graphs.
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2369428)
