Element orders and codegrees of characters in non-solvable groups
From MaRDI portal
Publication:6153575
Abstract: Given a finite group and an irreducible complex character of , the codegree of is defined as the integer . It was conjectured by G. Qian in [13] that, for every element of , there exists an irreducible character of such that is a multiple of the order of ; the conjecture has been verified under the assumption that is solvable ([13]) or almost-simple ([11]). In this paper, we prove that Qian's conjecture is true for every finite group whose Fitting subgroup is trivial, and we show that the analysis of the full conjecture can be reduced to groups having a solvable socle.
Recommendations
Cites work
- scientific article; zbMATH DE number 3904833 (Why is no real title available?)
- scientific article; zbMATH DE number 3906699 (Why is no real title available?)
- scientific article; zbMATH DE number 3736029 (Why is no real title available?)
- scientific article; zbMATH DE number 3526920 (Why is no real title available?)
- Brauer characters, degrees and subgroups
- Character degree graphs that are complete graphs
- Character degrees of extensions of \(\mathrm{PSL}_2(q)\) and \(\mathrm{SL}_2(q)\).
- Character theory of finite groups
- Co-degrees of irreducible characters in finite groups.
- Codegrees and element orders of almost simple groups
- Element orders and character codegrees
- Extending the Steinberg representation
- Extensions of unipotent characters and the inductive McKay condition.
- Groups with few \(p'\)-character degrees
- On spectra of automorphic extensions of finite simple groups \(F_4(q)\) and \(^3D_4(q)\)
- Problems on characters: solvable groups
Cited in
(2)
This page was built for publication: Element orders and codegrees of characters in non-solvable groups
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6153575)