Computing characters of groups with central subgroups

被引:0
|
作者
Dabbaghian, Vahid [1 ]
Dixon, John D. [2 ]
机构
[1] Simon Fraser Univ, IRMACS Ctr, MoCSSy Program, Burnaby, BC V5A 1S6, Canada
[2] Carleton Univ, Sch Math & Stat, Ottawa, ON K1S 5B6, Canada
基金
加拿大自然科学与工程研究理事会;
关键词
TABLE;
D O I
10.1112/S1461157013000211
中图分类号
O29 [应用数学];
学科分类号
070104 ;
摘要
The so-called Burnside-Dixon-Schneider (BDS) method, currently used as the default method of computing character tables in GAP for groups which are not solvable, is often inefficient in dealing with groups with large centres. If G is a finite group with centre Z and lambda a linear character of Z, then we describe a method of computing the set Irr(G, lambda) of irreducible characters x of G whose restriction chi(Z) is a multiple of A. This modification of the BDS method involves only [Irr(G, lambda)] conjugacy classes of G and so is relatively fast. A generalization of the method can be applied to computation of small sets of characters of groups with a solvable normal subgroup.
引用
收藏
页码:398 / 406
页数:9
相关论文
共 50 条