Isaacs–Seitz conjecture on solvable-group derived length

Less than 1 year old · traced to

For a finite group GG, let Irr⁡(G)\operatorname{Irr}(G) be the set of irreducible characters and define the set of irreducible character degrees by

cd⁡(G)=χ(1)∣χ∈Irr⁡(G).\operatorname{cd}(G)=\\{\chi(1)\mid\chi\in\operatorname{Irr}(G)\\}.

Let dl⁡(G)\operatorname{dl}(G) denote the derived length of GG. Isaacs–Seitz conjecture. If GG is solvable, then

dl⁡(G)≤∣cd⁡(G)∣.\operatorname{dl}(G)\le |\operatorname{cd}(G)|.

The conjecture has been proved in many cases, but the general problem remains open; the source records Gluck's weaker bound dl⁡(G)≤2∣cd⁡(G)∣\operatorname{dl}(G)\le2|\operatorname{cd}(G)|.

References

Primary source

Alexander Moretó, “The Main Problem of Block Theory: Picky Elements and Subnormalizers”, arXiv:2604.24565 (2026).

Progress summary

Never refreshed

Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.

Solutions 0

No solutions have been posted yet.