Finite groups with some bounded codegrees
Let \(\chi\) be an irreducible character of a finite group \(G\). The codegree \(\operatorname{cod}(\chi)\) of \(\chi\) is defined as the number \(|G : \ker \chi| / \chi(1)\), where \(\ker \chi\) is the kernel of \(\chi\). As has been shown in numerous research papers, the set of codegrees of a finite group significantly impacts its structure. Imposing certain conditions on the set of codegrees can determine some of the properties of the group in general. In the paper under review, the authors investigate a solvability criterion based on the minimum of \(\chi(1)^2 / \operatorname{cod}(\chi)\), where \(\chi\) ranges over all irreducible characters of \(G\). In particular, they prove that if \[ \frac{\chi(1)^2}{\operatorname{cod}(\chi)} > \frac{2^9 \cdot 3^2 \cdot 19^2}{5 \cdot 7^3 \cdot 11 \cdot 13} \] for every irreducible character \(\chi\) of \(G\), then \(G\) is solvable. The proof relies on the classification of finite simple groups.
- A character theoretic criterion for a p-closed group.
- A note on element orders and character codegrees.
- Character degree graphs that are complete graphs
- Character degree sums in finite nonsolvable groups.
- Co-degrees of irreducible characters in finite groups.
- Extending the Steinberg representation
- Finite groups with coprime character degrees and codegrees
- Finite groups with special codegrees
- scientific article; zbMATH DE number 3491212 (Why is no real title available?)
- scientific article; zbMATH DE number 3526920 (Why is no real title available?)
- On Thompson's conjecture for some finite simple groups.
- Steinberg-like characters for finite simple groups
- Symmetric groups are determined by their character degrees.
This page was built for publication: Finite groups with some bounded codegrees
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6596315)
