Counting characters of certain degrees
Let \(G\) be a finite group. A component of \(G\) is a perfect subnormal subgroup \(H\) of \(G\) such that \(H/Z(H)\) is simple. A group \(G\) is said to be quasi-nilpotent if it is the central product of its components and its Fitting subgroup. The generalized Fitting subgroup of \(G\), denoted by \(F^*(G)\), is the unique largest quasi-nilpotent normal subgroup of \(G\). Let \(ns(G)\) denote the product of the orders of all the nonabelian composition factors of \(G\) (counting repetitions). Theorem 1.4 and Corollary 1.5. Let \(\chi\) be an irreducible character of \(G\) and let \(p\) be a prime. (a) There is a subgroup \(H\) of \(G\) with \(H\geq F^*(G)\) and an irreducible character \(\alpha\) of \(H\) such that \(\chi=\alpha^G\) and \(\alpha(1)^2\) divides \(ns(H)|H:Z(F(G))|\). (b) Let \(d(\chi)\) denote the \(p\)-defect of \(\chi\). Then \(d(\chi)\geq\tfrac 12(s+z)\), where \(p^z=|Z(O_p(G))|_p\) and \(s\) is the number of composition factors of order \(p\) of \(H\), for \(H\) as in (a). In particular, \(d(\chi)\geq z\), and equality forces \(H/Z(F(G))\) to have no composition factor of order \(p\). Let \(N\) be a normal subgroup of \(G\) and \(\mu\in\text{Irr}(N)\). For \(n\in\mathbb{N}\), let \(k^n(G,\mu)\) denote the number of irreducible constituents of \(\mu^G\) of degree \(n\). The author explains that it is possible to compute \(k^n(G)\). Some results are formulated also for Brauer characters.
This page was built for publication: Counting characters of certain degrees
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4935773)
