Character codegrees, kernels, and Fitting heights of solvable groups
Abstract
For an irreducible character of a finite group G, let cod():=|G: ()|/(1) denote the codegree of , and let cod(G) be the set of irreducible character codegrees of G. In this note, we prove that if () is not nilpotent, then there exists an irreducible character of G such that ()<() and cod()> cod(). This provides a character codegree analogue of a classical theorem of Broline and Garrison. As a consequence, we obtain that for a nonidentity solvable group G, its Fitting height F(G) does not exceed |cod(G)|-1. Additionally, we provide two other upper bounds for the Fitting height of a solvable group G as follows: F(G)≤ 12(|cod(G)|+2), and F(G)≤ 82(|cod(G)|)+80.
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.