论文标题
Huppert的猜想的同等版本
Equivalent version of Huppert's conjecture on the codegrees
论文作者
论文摘要
令G为有限的组，IRR（G）IRR（G）中G和X \的所有不可还原复杂特征的集合。让COD（X）= | G：KERX |/X（1）和COD（G）= {COD（X）| x \ in Irr（g）}。在本说明中，我们表明，对于Prime Power Q> 3，简单组PSL（2，Q）由其代码集的集合唯一确定。
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.
