TL;DRAbstract
We let cd(G) = {χ(1)|χ ∈ Irr(G)}. I. M. Isaacs proved that if |cd(G)|≤3, then G is solvable and dl(G) ≤ |cd(G)| (see [Is, 12.6 and 12.15]). Since |cd(A5)| = 4, we cannot improve the first conclusion, but it has been conjectured by G. Seitz that dl(G) ≤ |cd(G)| for all solvable groups G. Isaacs gave the first general bound, namely dl(G) ≤ 3· |cd(G)| (or 2·|cd(G)| if |G| is odd). These are proved in Theorem 16.5 below. Lemma 16.4 is important here and further analysis allows us to present Gluck's improvement to dl(G) ≤ 2 · |cd(G)| in Theorem 16.8. Using Theorem 8.4, we give Berger's proof of Seitz's conjecture for groups of odd order. The key result here is Theorem 16.6, which does not hold for arbitrary solvable groups.
Chat with Paper
AI Agents for this Paper
We let cd(G) = {χ(1)|χ ∈ Irr(G)}. I. M. Isaacs proved that if |cd(G)|≤3, then G is solvable and dl(G) ≤ |cd(G)| (see [Is, 12.6 and 12.15]). Since |cd(A5)| = 4, we cannot improve the first conclusion, but it has been conjectured by G. Seitz that dl(G) ≤ |cd(G)| for all solvable groups G. Isaacs gave the first general bound, namely dl(G) ≤ 3· |cd(G)| (or 2·|cd(G)| if |G| is odd). These are proved in Theorem 16.5 below. Lemma 16.4 is important here and further analysis allows us to present Gluck's improvement to dl(G) ≤ 2 · |cd(G)| in Theorem 16.8. Using Theorem 8.4, we give Berger's proof of Seitz's conjecture for groups of odd order. The key result here is Theorem 16.6, which does not hold for arbitrary solvable groups.
Keywords
Chat
Click to start Chat