pith. sign in

arxiv: 1402.0366 · v2 · pith:YB5NY6JOnew · submitted 2014-02-03 · 🧮 math.GR

On a conjecture of Gluck

classification 🧮 math.GR
keywords conjecturefinitegroupcharacterdegreegluckirreduciblelargest
0
0 comments X
read the original abstract

Let $F(G)$ and $b(G)$ respectively denote the Fitting subgroup and the largest degree of an irreducible complex character of a finite group $G$. A well-known conjecture of D. Gluck claims that if $G$ is solvable then $|G:F(G)|\leq b(G)^{2}$. We confirm this conjecture in the case where $|F(G)|$ is coprime to 6. We also extend the problem to arbitrary finite groups and prove several results showing that the largest irreducible character degree of a finite group strongly controls the group structure.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.