2000 character limit reached
Character codegrees of maximal class p-groups
Published 20 Sep 2018 in math.GR | (1809.07699v1)
Abstract: Let $G$ be a $p$-group and let $\chi$ be an irreducible character of $G$. The codegree of $\chi$ is given by $|G:\text{ker}(\chi)|/\chi(1)$. If $G$ is a maximal class $p$-group that is normally monomial or has at most three character degrees then the codegrees of $G$ are consecutive powers of $p$. If $|G|=pn$ and $G$ has consecutive $p$-power codegrees up to $p{n-1}$ then the nilpotence class of $G$ is at most 2 or $G$ has maximal class.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.