ON THE CODEGREES OF STRONGLY MONOLITHIC CHARACTERS OF FINITE GROUPS
Abstract Let G be a finite group and let $\chi $ be an irreducible character of G . The number $|G:\mathrm {ker}\chi |/\chi (1)$ is called the codegree of the character $\chi $ . We provide several relations between the structure of G and the codegrees of the characters in a given subset of $\mathrm {Irr}(G)$ , where $\mathrm {Irr}(G)$ is the set of all complex irreducible characters of G . For example, we show that if the codegrees of all strongly monolithic characters of G are odd, then G is solvable, analogous to the well-known fact that if all irreducible character degrees of a finite group are odd, then that group is solvable.
Authors
- Utku Yilmaztürk (ORCID: https://orcid.org/0000-0003-2866-1516)
- Temha Erkoç (ORCID: https://orcid.org/0000-0001-5437-3679)
Institutions
- Istanbul University (TR)
Publication Details
- Journal
- Bulletin of the Australian Mathematical Society
- Published
- 2024-11-07
- DOI
- https://doi.org/10.1017/s0004972724000935
- Primary Topic
- Coding theory and cryptography
- Type
- article
- Field-Weighted Citation Impact
- 0.00
Funders
- Türkiye Bilimsel ve Teknolojik Araştırma Kurumu