The character co-degree sets and solvability
From MaRDI portal
Publication:6192147
DOI10.1142/s0219498824501172OpenAlexW4317520079MaRDI QIDQ6192147
Ali Reza Naghipour, Roya Bahramian, Neda Ahanjideh
Publication date: 11 March 2024
Published in: Journal of Algebra and Its Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1142/s0219498824501172
Ordinary representations and characters (20C15) Finite simple groups and their classification (20D05)
Cites Work
- Unnamed Item
- Unnamed Item
- Finite groups with a given set of character degrees.
- Characters of relative \(p^\prime\)-degree over normal subgroups
- Rational matrix groups of a special type
- On character degrees quotients
- Extending the Steinberg representation
- On Thompson's theorem
- Some nonsolvable character degree sets
- Co-degrees of irreducible characters in finite groups.
- The two-prime hypothesis: groups whose nonabelian composition factors are not isomorphic to \(\mathrm{PSL}_2(q)\)
- \(p\)-parts of co-degrees of irreducible characters
- Character degree graphs that are complete graphs
- Element orders and character codegrees
- NONDIVISIBILITY AMONG IRREDUCIBLE CHARACTER CO-DEGREES
- -DIVISIBILITY OF CO-DEGREES OF IRREDUCIBLE CHARACTERS
- The one-prime hypothesis on the co-degrees of irreducible characters
- Non-solvable groups and the two-prime hypothesis on conjugacy class sizes
- The set of character degrees of a finite group does not determine its solvability
- Nonsolvable groups with five character codegrees
- Nonsolvable groups with no prime dividing three character degrees.
- Prime power degree representations of quasi-simple groups
- The Fitting subgroup, p‐length, derived length and character table
- Multiplicities of character codegrees of finite groups
This page was built for publication: The character co-degree sets and solvability