A note on codegrees and Taketa's inequality
Abstract
Let G be a finite group and cd(G) will be the set of the degrees of the complex irreducible characters of G. Also let cod(G) be the set of codegrees of the irreducible characters of G. The Taketa problem conjectures if G is solvable, then dl(G) ≤ | cd(G)|, where dl(G) is the derived length of G. In this note, we show that dl(G) ≤ | cod(G)| in some cases and we conjecture that this inequality holds if G is a finite solvable group.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.