Bounding the derived length for a given set of character degrees.

DOI10.1007/S10468-010-9224-8zbMath1245.20004OpenAlexW1976675730MaRDI QIDQ431837

Kamal Aziziheris

Publication date: 3 July 2012

Published in: Algebras and Representation Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10468-010-9224-8

zbMATH Keywords

finite solvable groupsirreducible complex characterscharacter degreesderived lengthsTaketa inequalitycharacter degree sets

Mathematics Subject Classification ID

Ordinary representations and characters (20C15) Finite solvable groups, theory of formations, Schunck classes, Fitting classes, (pi)-length, ranks (20D10) Arithmetic and combinatorial problems involving abstract finite groups (20D60)

Related Items (2)

Finite groups with a given set of character degrees. ⋮ Some character degree conditions implying solvability of finite groups.

Cites Work

• Unnamed Item
• Unnamed Item
• Determining group structure from the sets of character degrees.
• Determining group structure from sets of irreducible character degrees
• Irreducible character degrees and normal subgroups
• Groups having three complex irreducible character degrees
• Solvable groups whose degree graphs have two connected components
• Coprime Group Actions Fixing All Nonlinear Irreducible Characters
• A note on character degrees of finite groups
• Groups Having at Most Three Irreducible Character Degrees
• Derived lengths of solvable groups having five irreducible character degrees. I.

This page was built for publication: Bounding the derived length for a given set of character degrees.