English

A note on codegrees and Taketa's inequality

Group Theory 2021-07-06 v2

Abstract

Let GG be a finite group and cd(G){\rm cd}(G) will be the set of the degrees of the complex irreducible characters of GG. Also let cod(G){\rm cod}(G) be the set of codegrees of the irreducible characters of GG. The Taketa problem conjectures if GG is solvable, then dl(G)cd(G){\rm dl}(G) \leq |{\rm cd}(G)|, where dl(G){\rm dl}(G) is the derived length of GG. In this note, we show that dl(G)cod(G){\rm dl}(G) \leq |{\rm cod}(G)| in some cases and we conjecture that this inequality holds if GG is a finite solvable group.

Keywords

Cite

@article{arxiv.2107.00735,
  title  = {A note on codegrees and Taketa's inequality},
  author = {Mahtab Delfani and Mohsen Ghasemi and Somayeh Hekmatara},
  journal= {arXiv preprint arXiv:2107.00735},
  year   = {2021}
}

Comments

There is a mistake in the proof of lemma 3.1

R2 v1 2026-06-24T03:49:25.619Z