Equivalent version of Huppert's conjecture on the codegrees
Abstract
Let G be a finite group, Irr(G) the set of all irreducible complex characters of G and X ∈ Irr(G). Let also cod(X) = |G : kerX|/X(1) and cod(G) = cod(X) | X ∈ Irr(G). In this note, we show that the simple group PSL(2, q), for a prime power q > 3, is uniquely determined by the set of its codegree.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.