The character co-degree sets and solvability
From MaRDI portal
Publication:6192147
Recommendations
Cites work
- scientific article; zbMATH DE number 3526920 (Why is no real title available?)
- scientific article; zbMATH DE number 3294681 (Why is no real title available?)
- Character degree graphs that are complete graphs
- Characters of relative \(p^\prime\)-degree over normal subgroups
- Co-degrees of irreducible characters in finite groups.
- Element orders and character codegrees
- Extending the Steinberg representation
- Finite groups with a given set of character degrees.
- Multiplicities of character codegrees of finite groups
- NONDIVISIBILITY AMONG IRREDUCIBLE CHARACTER CO-DEGREES
- Non-solvable groups and the two-prime hypothesis on conjugacy class sizes
- Nonsolvable groups with five character codegrees
- Nonsolvable groups with no prime dividing three character degrees.
- On Thompson's theorem
- On character degrees quotients
- Prime power degree representations of quasi-simple groups
- Rational matrix groups of a special type
- Some nonsolvable character degree sets
- The Fitting subgroup, p‐length, derived length and character table
- The one-prime hypothesis on the co-degrees of irreducible characters
- The set of character degrees of a finite group does not determine its solvability.
- The two-prime hypothesis: groups whose nonabelian composition factors are not isomorphic to \(\mathrm{PSL}_2(q)\)
- \(p\)-divisibility of co-degrees of irreducible characters
- \(p\)-parts of co-degrees of irreducible characters
Cited in
(2)
This page was built for publication: The character co-degree sets and solvability
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6192147)