p-groups with exactly four codegrees

From MaRDI portal
\(p\)-groups with exactly four codegrees



Abstract: Let G be a p-group and let chi be an irreducible character of G. The codegree of chi is given by |G:extker(chi)|/chi(1). Du and Lewis have shown that a p-group with exactly three codegrees has nilpotence class at most 2. Here we investigate p-groups with exactly four codegrees. If, in addition to having exactly four codegrees, G has two irreducible character degrees, G has largest irreducible character degree p2, |G:G′|=p2, or G has coclass at most 3, then G has nilpotence class at most 4. In the case of coclass at most 3, the order of G is bounded by p7. With an additional hypothesis we can extend this result to p-groups with four codegrees and coclass at most 7. In this case the order of G is bounded by p11.


Let \(G\) be a finite group. For \(\chi\in\mathrm{Irr}(G\)) the codegree is defined as \(\mathrm{cod}(\chi)=|G:\mathrm{Ker}(\chi)|/\chi(1)\). Write \(\mathrm{cod}(G)\) for the set of all codegrees of \(G\). It is known that a \(p\)-group with exactly two codegrees is elementary abelian, and a \(p\)-group with exactly three codegrees has nilpotence class at most 2. The paper under review makes some advances on bounding the nilpotence class of \(p\)-groups with four codegrees by proving the following result. Theorem. Suppose that \(\mathrm{cod}(G)=\{1, p, p^b, p^a\}\), where \({2\le b< a}\). If any of the following holds, then \(G\) has nilpotence class at most 4: (i) \(|\mathrm{cd}(G)|=2\); (ii) \(\mathrm{cd}(G)=\{1,p,p^2\}\); (iii) \(|G:G^{'}|=p^2\). There are some more results under more special hypotheses.





Describes a project that uses

Uses Software






This page was built for publication: \(p\)-groups with exactly four codegrees

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2208332)