Back to Search
Start Over
A note on codegrees and Taketa's inequality
- Publication Year :
- 2021
-
Abstract
- Let $G$ be a finite group and ${\rm cd}(G)$ will be the set of the degrees of the complex irreducible characters of $G$. Also let ${\rm cod}(G)$ be the set of codegrees of the irreducible characters of $G$. The Taketa problem conjectures if $G$ is solvable, then ${\rm dl}(G) \leq |{\rm cd}(G)|$, where ${\rm dl}(G)$ is the derived length of $G$. In this note, we show that ${\rm dl}(G) \leq |{\rm cod}(G)|$ in some cases and we conjecture that this inequality holds if $G$ is a finite solvable group.<br />Comment: There is a mistake in the proof of lemma 3.1
- Subjects :
- Mathematics - Group Theory
Subjects
Details
- Database :
- arXiv
- Publication Type :
- Report
- Accession number :
- edsarx.2107.00735
- Document Type :
- Working Paper