On groups with square-free gcd of character degree and codegree
Karam Aldahleh, Alan Kappler, Neil Makur, Yong Yang

TL;DR
This paper investigates the structure of finite groups where the greatest common divisor of each irreducible character degree and codegree is square-free, revealing that such groups are closely related to specific almost simple groups.
Contribution
It generalizes a previous result by characterizing non-solvable groups with square-free gcd of character degree and codegree, solving an open problem by Guohua Qian.
Findings
If gcd of degree and codegree is square-free for all characters, then the group modulo its solvable radical is almost simple.
The structure of these groups is limited to a specific list of almost simple groups.
The result extends understanding of the relationship between character theory and group structure.
Abstract
Let be a finite group and be an irreducible character of . The codegree of is defined as . In a paper by Gao, Wang, and Chen, it was shown that cannot satisfy the condition that is prime for all . We generalize this theorem by solving one of Guohua Qian's unsolved problems on character codegrees. Qian inquires about the structure of non-solvable finite groups with square-free instead. We prove that if is such that is square-free for every irreducible character , then is isomorphic to one among a particular list of almost simple groups.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsFinite Group Theory Research · Rings, Modules, and Algebras · graph theory and CDMA systems
