On the largest character codegree of a finite group
Let \(G\) be a finite group and let \(\mathrm{Irr}(G)\) be the set of all irreducible complex characters of \(G\). Also, let \(\operatorname{cod}(G)=\{ \operatorname{cod}(\chi) \mid \chi \in \mathrm{Irr}(G) \}\), where the codegree \(\operatorname{cod}(\chi)\) of \(\chi\) is defined by \(\operatorname{cod}(\chi) =\frac{|G : \ker(\chi)|}{\chi(1)}\). Let \(b^{c}(G)\) be the largest codegree of \(G\).\N\NThe authors study how the structure of a group \(G\) is bounded by \(b^{c}(G)\). Firstly, they give a criterion for solvability: if \(b^{c}(G) < 20\), then \(G\) is solvable (such a result is optimal in that \(b^{c}(A_{5})=20\)). Secondly, they consider the non-solvable groups \(G\) with small \(b^{c}(G)\) and prove that, if \(b^{c}(G) < 56\), then \(G\) is isomorphic to \(A_{5}\), \(S_{5}\) or \(A_{5} \times A\), where \(A\) is an elementary abelian \(2\)-group (such a result is optimal in that \(b^{c}(\mathrm{PSL}(2,7))=56\)).
- A note on element orders and character codegrees.
- Character theory of finite groups.
- Co-degrees of irreducible characters in finite groups.
- Element orders and character codegrees
- Element orders and character codegrees.
- Element orders and codegrees of characters in non-solvable groups
- Groups with few codegrees of irreducible characters
- scientific article; zbMATH DE number 5544145 (Why is no real title available?)
- scientific article; zbMATH DE number 1932303 (Why is no real title available?)
- Nonsolvable groups with five character codegrees
- Nonsolvable groups with four character codegrees
- Nonsolvable groups with no prime dividing three character degrees.
- On Gluck's conjecture
- The largest Irreducible Character Degree of a Finite Group
This page was built for publication: On the largest character codegree of a finite group
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6617369)
