{"title":"具有中心子群的群的计算特征","authors":"V. Dabbaghian, J. Dixon","doi":"10.1112/S1461157013000211","DOIUrl":null,"url":null,"abstract":"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 inecient in dealing with groups with large centres. If G is a nite group with centre Z and a linear character of Z, then we describe a method of computing the set Irr(G; ) of irreducible characters of G whose restriction Z is a multiple of . This modication of the BDS method involves only jIrr(G; )j 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.","PeriodicalId":54381,"journal":{"name":"Lms Journal of Computation and Mathematics","volume":"16 1","pages":"398-406"},"PeriodicalIF":0.0000,"publicationDate":"2013-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1112/S1461157013000211","citationCount":"1","resultStr":"{\"title\":\"Computing characters of groups with central subgroups\",\"authors\":\"V. Dabbaghian, J. Dixon\",\"doi\":\"10.1112/S1461157013000211\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"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 inecient in dealing with groups with large centres. If G is a nite group with centre Z and a linear character of Z, then we describe a method of computing the set Irr(G; ) of irreducible characters of G whose restriction Z is a multiple of . This modication of the BDS method involves only jIrr(G; )j 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.\",\"PeriodicalId\":54381,\"journal\":{\"name\":\"Lms Journal of Computation and Mathematics\",\"volume\":\"16 1\",\"pages\":\"398-406\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2013-10-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"https://sci-hub-pdf.com/10.1112/S1461157013000211\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Lms Journal of Computation and Mathematics\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1112/S1461157013000211\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q1\",\"JCRName\":\"Mathematics\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Lms Journal of Computation and Mathematics","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1112/S1461157013000211","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"Mathematics","Score":null,"Total":0}
Computing characters of groups with central subgroups
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 inecient in dealing with groups with large centres. If G is a nite group with centre Z and a linear character of Z, then we describe a method of computing the set Irr(G; ) of irreducible characters of G whose restriction Z is a multiple of . This modication of the BDS method involves only jIrr(G; )j 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.
期刊介绍:
LMS Journal of Computation and Mathematics has ceased publication. Its final volume is Volume 20 (2017). LMS Journal of Computation and Mathematics is an electronic-only resource that comprises papers on the computational aspects of mathematics, mathematical aspects of computation, and papers in mathematics which benefit from having been published electronically. The journal is refereed to the same high standard as the established LMS journals, and carries a commitment from the LMS to keep it archived into the indefinite future. Access is free until further notice.