Element orders and codegrees of characters in non-solvable groups

DOI10.1016/J.JALGEBRA.2024.01.011MaRDI QIDQ6153575zbMATH OpenOpenAlexWikidataFDO

Authors Z. Akhlaghi, Emanuele Pacifici, Lucia Sanus

Publication date 14 February 2024

Published in Journal of Algebra (Search for Journal in Brave)

Copyright license Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International

Full work available at URL https://arxiv.org/abs/2306.08545

zbMATH Keywords

character codegreeirreducible character

Mathematics Subject Classification ID

Ordinary representations and characters (20C15)

Abstract: Given a finite group $G$ and an irreducible complex character $chi$ of $G$, the codegree of $chi$ is defined as the integer $mcod(chi)=|G:kerchi|/chi(1)$. It was conjectured by G. Qian in [13] that, for every element $g$ of $G$, there exists an irreducible character $chi$ of $G$ such that $mcod(chi)$ is a multiple of the order of $g$; the conjecture has been verified under the assumption that $G$ 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.

Review text

Let \(G\) be a finite group and \(\mathrm{Irr}(G)\) the set of irreducible characters of \(G\). The codegree of an element \(\chi \in \mathrm{Irr}(G)\) is the number \(\mathrm{cod}(\chi)=\big | G : \ker \chi \big |\cdot \chi(1)^{-1}\). An interesting question related to character codegrees was formulated by \textit{G. Qian} [Arch. Math. 97, No. 2, 99--103 (2011; Zbl 1232.20014)]: it is asked whether, for \(g \in G\), there exists \(\chi \in \mathrm{Irr}(G)\) such that \(\mathrm{cod}(\chi)\) is divisible \(o(g)\), the order of \(g\). This conjecture is a generalization of the following theorem (proved by Qian [loc. cit.] for solvable groups and in full generality by \textit{I. M. Isaacs} [Arch. Math. 97, No. 6, 499--501 (2011; Zbl 1245.20005)]): for every \(g \in G\) there is \(\chi \in \mathrm{Irr}(G)\) such that \(\ker \chi \cap \langle g \rangle =1\) and \(\pi(\mathrm{cod}(\chi))=\pi(o(g))\). The Qian conjecture has been verified under the assumption that \(G\) is solvable [\textit{G. Qian}, Bull. Lond. Math. Soc. 53, No. 3, 820--824 (2021; Zbl 1493.20003)] or almost-simple [\textit{S. Y. Madanha}, Commun. Algebra 51, No. 7, 3143--3151 (2023; Zbl 1522.20036)]. In the paper under review, the authors prove that Qian's conjecture is true for every finite group whose Fitting subgroup is trivial (Theorem A). They also show that a minimal counterexample to Quian's conjecture would be a group whose minimal normal subgroups are all abelian (Remark 3.1).

Recommendations

• Codegrees and element orders of almost simple groups
• Element orders and character codegrees.
• Element orders and character codegrees
• A note on element orders and character codegrees.
• Character codegrees and element orders in symmetric and alternating groups

Cites work

• 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
• 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?)
• On spectra of automorphic extensions of finite simple groups F₄(q) and ^3D₄(q)
• Problems on characters: solvable groups

Cited in

(7)

• ON A QUESTION OF MORETÓ
• Character codegrees and element orders in symmetric and alternating groups
• On the largest character codegree of a finite group
• On a question of the character codegrees set
• Degrees and constituents of characters
• Finite groups in which every irreducible character has either p'-degree or p'-codegree
• Finite groups with non-complete character codegree graphs

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)