Constructing Pairs of Compatible Characters

• 来源期刊: 代数集刊（英文版）
• 关键词: characters of finite groups compatibility interlinking graph representatives of conjugacy classes length-lexicographically lowest base-word
• 年，卷（期）: 2003,（3）
• 页码范围: 285-302
• 页数: 18页
• 语种: 英文

摘要

Given a finite group X such that both the conjugacy of elements in X and the length of any conjugacy class in X can be decided/computed efficiently,the first algorithm described in this article constructs a uniquely determined sequence of representatives for all the conjugacy classes of X. In particular, based on this sequence, any two characters of different groups isomorphic to X become comparable against each other which is utilized by a second algorithm designed to construct so-called compatible characters of given finite groups G and H having isomorphic subgroups U ≤ G and V ≤ H, respectively.