Finite groups in which every irreducible character has either p'-degree or p'-codegree

2024/11/07 by Guohua Qian, Yu Zeng, Qian, Guohua +1
Engineering · Mathematics · Computer Science · #graph theory and CDMA systems #Finite Group Theory Research #Coding theory and cryptography

paper · pdf · doi:10.48550/arxiv.2411.04478

Abstract

For an irreducible complex character χ of a finite group G, the codegree of χ is defined by |G:ker(χ)|/χ(1), where ker(χ) is the kernel of χ. Given a prime p, we provide a classification of finite groups in which every irreducible complex character has either p'-degree or p'-codegree.

Related

• Finite groups of non-prime-power order with exactly four character codegrees
• Two results on character codegrees
• A characterization of some finite simple groups by their character codegrees
• On the multiplicities of the character codegrees
• Equivalent version of Huppert's conjecture on the codegrees