Equivalent version of Huppert's conjecture on the codegrees
Group Theory
2026-02-18 v1
Abstract
Let G be a finite group, Irr(G) the set of all irreducible complex characters of G and X \in Irr(G). Let also cod(X) = |G : kerX|/X(1) and cod(G) = {cod(X) | X \in 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.
Cite
@article{arxiv.2010.10463,
title = {Equivalent version of Huppert's conjecture on the codegrees},
author = {Afsane Bahri and Zeinab Akhlaghi and Behrooz Khosravi},
journal= {arXiv preprint arXiv:2010.10463},
year = {2026}
}