Solvability and supersolvability criteria related to character codegrees
type: Item
instance of: scholarly article
title: Solvability and supersolvability criteria related to character codegrees
zbMATH Open document ID: 1548.20012
author: Sesuai Yash Madanha
published in: Journal of Algebra and its Applications
publication date: 2024-09-18T00:00:00Z
review text: Let \(G\) be a finite group and let \(\mathrm{Irr}(G)\) be the set of irreducible characters of \(G\). If \(\chi \in \mathrm{Irr}(G)\), then the codegree of \(\chi\) is defined by \(\mathrm{cod}(\chi)=|G: \ker \chi|/\chi(1)\). \textit{S. M. Gagola} and \textit{M. L. Lewis} [Commun. Algebra 27, No. 3, 1053--1056 (1999; Zbl 0929.20010)] proved that \(G\) is nilpotent if and only if \(\chi(1)\) divides \(\mathrm{cod}(\chi)\) for all \(\chi \in \mathrm{Irr}(G)\).\N\NIt is known that a finite non-abelian simple group does not have a character codegree which is a prime power [\textit{D. Chillag} and \textit{M. Herzog}, Arch. Math. 55, No. 1, 25--29 (1990; Zbl 0671.20007)]. Moreover, \textit{F. Alizadeh} et al. [Commun. Algebra 49, No. 2, 538--544 (2021; Zbl 1498.20016)] proved that if \(G\) be a finite group with exactly one composite character codegree, then \(G\) is solvable.\N\NIn this vein, the following results are proved:\N\NTheorem A: Let \(G\) be a finite group with at most two composite character codegrees. Then \(G\) is solvable.\N\NTheorem B: Let \(G\) be a finite group. If \(\mathrm{cod}(\chi) \leq p_{\chi}(\chi(1)+1)\) for all non-linear \(\chi \in \mathrm{Irr}(G)\), where \(p_{\chi}\) is the largest prime divisor of \(|G: \ker \chi|\), then \(G\) is solvable.
reviewed by: Enrico Jabara
Mathematics Subject Classification ID: 20C15
Mathematics Subject Classification ID: 20D60
Mathematics Subject Classification ID: 20D10
zbMATH DE Number: 7915004
zbMATH Keywords: codegree
zbMATH Keywords: almost simple group
zbMATH Keywords: solvable group
zbMATH Keywords: supersolvable group
zbMATH Keywords: irreducible character
MaRDI profile type: Publication
cites work: Groups with few codegrees of irreducible characters
cites work: Finite groups whose codegrees are almost prime
cites work: Degrees, kernels and quasikernels of monolithic characters
cites work: Character degree graphs that are complete graphs
cites work: Q3682663
cites work: On character degrees quotients
cites work: The co-degrees of irreducible characters
cites work: Q3684278
cites work: A character theoretic condition characterizing nilpotent groups
cites work: Endliche Gruppen mit treuen absolut‐irreduziblen Darstellungen
cites work: Character theory of finite groups
cites work: Q3413656
cites work: Finite groups with coprime character degrees and codegrees
cites work: Finite groups with exactly one composite character degree
cites work: Extensions of unipotent characters and the inductive McKay condition.
cites work: Complex group algebras of finite groups: Brauer's problem 1.
cites work: A character theoretic criterion for a \(p\)-closed group.
cites work: Co-degrees of irreducible characters in finite groups.
cites work: Finite Groups Having Only One Irreducible Representation of Degree Greater than One
cites work: The Character Tables for SL(3, q), SU(3, q2), PSL(3, q), PSU(3, q2)
cites work: Alternating and sporadic simple groups are determined by their character degrees.
cites work: Character degrees of extensions of \(\mathrm{PSL}_2(q)\) and \(\mathrm{SL}_2(q)\).
cites work: Finite groups with special codegrees
DOI: 10.1142/S0219498824501676
description: scientific article; zbMATH DE number 7915004