Bounding group orders by large character degrees: A question of Snyder

Abstract

Let G be a nonabelian finite group and let d be an irreducible character degree of G. Then there is a positive integer e so that |G| = d(d+e). Snyder has shown that if e > 1, then |G| is bounded by a function of e. This bound has been improved by Isaacs and by Durfee and Jensen. In this paper, we will show for groups that have a nontrivial, abelian normal subgroup that |G| e4 - e3. We use this to prove that |G| < e4 + e3 for all groups. Given that there are a number of solvable groups that meet the first bound, it is best possible. Our work makes use of results regarding Camina pairs, Gagola characters, and Suzuki 2-groups.

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…