Solvability and supersolvability criteria related to character codegrees
Sesuai Y. Madanha · Journal of Algebra and Its Applications · 2023
Let [Formula: see text] be a finite group and Irr([Formula: see text]) be the set of irreducible characters of [Formula: see text]. The number cod([Formula: see text]) = [Formula: see text]ker [Formula: see text] is called the character codegree of [Formula: see text] Irr([Formula: see text]). In this paper, we show that if [Formula: see text] has at most two composite character codegrees, then [Formula: see text] is solvable. We also obtain sufficient numerical conditions on the character codegrees and character degrees for the solvability and supersolvability of a group.