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

preprint2012arXivOpen access

Abstract

Let GG be a nonabelian finite group and let dd be an irreducible character degree of GG. Then there is a positive integer ee so that ∣G∣=d(d+e)|G| = d(d+e). Snyder has shown that if e>1e > 1, then ∣G∣|G| is bounded by a function of ee. 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|G| \le e^4 - e^3. We use this to prove that ∣G∣<e4+e3|G| < e^4 + e^3 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.

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Reviews 0

Write a reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.