{"title":"应用于计算布劳尔字符表的新凝聚方法","authors":"Klaus Lux , A.J.E. Ryba","doi":"10.1016/j.jaca.2024.100023","DOIUrl":null,"url":null,"abstract":"<div><div>Condensation is a technique that can often predict a Brauer character table of a finite group with a very high degree of confidence, but without a proof of correctness. In this paper we describe a strategy that can give such a proof. We introduce and apply two novel condensation methods: virtual tensor condensation and the condensation of bilinear forms. We illustrate our strategy and new techniques with examples taken from our computation of the 5-modular Brauer character table of the sporadic simple Lyons group.</div></div>","PeriodicalId":100767,"journal":{"name":"Journal of Computational Algebra","volume":"12 ","pages":"Article 100023"},"PeriodicalIF":0.0000,"publicationDate":"2024-10-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"New condensation methods with applications to the computation of Brauer character tables\",\"authors\":\"Klaus Lux , A.J.E. Ryba\",\"doi\":\"10.1016/j.jaca.2024.100023\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<div><div>Condensation is a technique that can often predict a Brauer character table of a finite group with a very high degree of confidence, but without a proof of correctness. In this paper we describe a strategy that can give such a proof. We introduce and apply two novel condensation methods: virtual tensor condensation and the condensation of bilinear forms. We illustrate our strategy and new techniques with examples taken from our computation of the 5-modular Brauer character table of the sporadic simple Lyons group.</div></div>\",\"PeriodicalId\":100767,\"journal\":{\"name\":\"Journal of Computational Algebra\",\"volume\":\"12 \",\"pages\":\"Article 100023\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2024-10-02\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Journal of Computational Algebra\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://www.sciencedirect.com/science/article/pii/S2772827724000135\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Journal of Computational Algebra","FirstCategoryId":"1085","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S2772827724000135","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
New condensation methods with applications to the computation of Brauer character tables
Condensation is a technique that can often predict a Brauer character table of a finite group with a very high degree of confidence, but without a proof of correctness. In this paper we describe a strategy that can give such a proof. We introduce and apply two novel condensation methods: virtual tensor condensation and the condensation of bilinear forms. We illustrate our strategy and new techniques with examples taken from our computation of the 5-modular Brauer character table of the sporadic simple Lyons group.