Equivalent version of Huppert's conjecture on the codegrees

2020/10/20 by Afsaneh Bahri, Bahri, Afsaneh, Zeinab Akhlaghi +3
Computer Science · Mathematics · #Computability, Logic, AI Algorithms #FOS: Mathematics #Group Theory (math.GR) #Rings, Modules, and Algebras #semigroups and automata theory

paper · pdf · doi:10.48550/arxiv.2010.10463

openalex publication_date 2020/10/20 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28

Abstract

Let G be a finite group, Irr(G) the set of all irreducible complex characters of G and X ∈ Irr(G). Let also cod(X) = |G : kerX|/X(1) and cod(G) = cod(X) | X ∈ Irr(G). In this note, we show that the simple group PSL(2, q), for a prime power q > 3, is uniquely determined by the set of its codegree.

Related

• Huppert's analogue conjecture for \PSL(3,q) and \PSU(3,q)
• Two results on character codegrees
• Finite groups in which every irreducible character has either p'-degree or p'-codegree
• The codegree isomorphism problem for finite simple groups II
• On the Characterization of Sporadic Simple Groups by Codegrees