Two results on character codegrees
Ordinary representations and characters (20C15) Finite solvable groups, theory of formations, Schunck classes, Fitting classes, (pi)-length, ranks (20D10) Sylow subgroups, Sylow properties, (pi)-groups, (pi)-structure (20D20) Special subgroups (Frattini, Fitting, etc.) (20D25) General structure theorems for groups (20E34)
Let \(G\) be a finite group, \(\mathrm{Irr}(G)\) the set of irreducible complex characters of \(G\). For \(\chi \in \mathrm{Irr}(G)\), let \(\mathrm{cod}(\chi)=|G: \ker \chi|/\chi(1)\) be the codegree of \(\chi\).\N\NThe (element order) prime graph (Gruenberg-Kegel graph) of \(G\) is the graph whose vertices are the prime numbers dividing the order of the group, with two vertices being linked by an edge if and only if their product divides the order of some element of the group. In an analogous manner, the codegree graph of \(G\) is defined.\N\NThe paper under review is dedicated to the relationships between these two graphs in the case where \(G\) is solvable. The first result is the following.\N\NProposition 2.4: Let \(G\) be a solvable group such that every minimal normal subgroup is a Sylow subgroup and \(|G/F(G)|\) is square-free. For any prime pairs \((p,q)\), if \(pq \, \big |\, \mathrm{cod}(\chi)\) for some \(\chi \in \mathrm{Irr}(G)\), then there exists an element \(g \in G\) such that \(pq\) divides the order of \(g\).\N\NInspired by the results by \textit{A. Gruber} et al. [J. Algebra 442, 397--422 (2015; Zbl 1331.20029)] on Gruenberg-Kegel graph, the authors obtain the following result:\N\NProposition 2.5: An unlabeled graph \(F\) is isomorphic to the codegree prime graph of some solvable group if and only if its complement \(\overline{F}\) is \(3\)-colorable and triangle-free.\N\NIn particular, a graph is a codegree graph of a solvable group if and only if it is a Gruenberg-Kegel graph of some solvable group.
- A character theoretic condition characterizing nilpotent groups
- A character theoretic criterion for a p-closed group.
- A characterization of the prime graphs of solvable groups.
- A note on element orders and character codegrees.
- Character codegrees in finite groups
- Character codegrees of maximal class \(p\)-groups
- Character theory of finite groups.
- Codegrees and nilpotence class of \(p\)-groups.
- Element orders and character codegrees.
- Groups with few codegrees of irreducible characters
- scientific article; zbMATH DE number 1932303 (Why is no real title available?)
- Nonsolvable groups with five character codegrees
- Nonsolvable groups with four character codegrees
- On character degrees quotients
- On codegrees and solvable groups
- The prime graphs of some classes of finite groups
This page was built for publication: Two results on character codegrees
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7012396)
