The largest character degrees of the symmetric and alternating groups

Abstract

We show that the largest character degree of an alternating group An with n≥ 5 can be bounded in terms of smaller degrees in the sense that \[ b(An)2<Σ∈Irr(An),\,(1)< b(An)(1)2, \] where Irr(An) and b(An) respectively denote the set of irreducible complex characters of An and the largest degree of a character in Irr(An). This confirms a prediction of I. M. Isaacs for the alternating groups and answers a question of M. Larsen, G. Malle, and P. H. Tiep.

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.

Discussion (0)

Sign in to join the discussion.

Loading comments…