Groups Having a Character of Maximal Degree

Abstract

Let G be a group, let d be a character degree, and let e be the integer so that |G| = d(d+e). It has been shown when e > 1 that |G| e4 - e3. In this paper, we consider the groups where |G| = e4 - e3. It is known that e must be a power of a prime. We classify the groups where e is a prime and where e is 4, 9, and 25. In so doing, we find a new nonsolvable Camina pair.

0

Turn this paper into a full lesson

ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…