{"title":"有限简单群谱生成算法的时间复杂度","authors":"A. Buturlakin","doi":"10.33048/semi.2022.19.009","DOIUrl":null,"url":null,"abstract":"The spectrum ω(G) is the set of orders of elements of G. We consider the problem of generating the spectrum of a finite nonabelian simple group G given by the degree of G if G is an alternating group, or the Lie type, Lie rank and order of the underlying field if G is a group of Lie type.","PeriodicalId":45858,"journal":{"name":"Siberian Electronic Mathematical Reports-Sibirskie Elektronnye Matematicheskie Izvestiya","volume":" ","pages":""},"PeriodicalIF":0.4000,"publicationDate":"2021-09-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"The time complexity of some algorithms for generating the spectra of finite simple groups\",\"authors\":\"A. Buturlakin\",\"doi\":\"10.33048/semi.2022.19.009\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The spectrum ω(G) is the set of orders of elements of G. We consider the problem of generating the spectrum of a finite nonabelian simple group G given by the degree of G if G is an alternating group, or the Lie type, Lie rank and order of the underlying field if G is a group of Lie type.\",\"PeriodicalId\":45858,\"journal\":{\"name\":\"Siberian Electronic Mathematical Reports-Sibirskie Elektronnye Matematicheskie Izvestiya\",\"volume\":\" \",\"pages\":\"\"},\"PeriodicalIF\":0.4000,\"publicationDate\":\"2021-09-27\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Siberian Electronic Mathematical Reports-Sibirskie Elektronnye Matematicheskie Izvestiya\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.33048/semi.2022.19.009\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q4\",\"JCRName\":\"MATHEMATICS\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Siberian Electronic Mathematical Reports-Sibirskie Elektronnye Matematicheskie Izvestiya","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.33048/semi.2022.19.009","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q4","JCRName":"MATHEMATICS","Score":null,"Total":0}
The time complexity of some algorithms for generating the spectra of finite simple groups
The spectrum ω(G) is the set of orders of elements of G. We consider the problem of generating the spectrum of a finite nonabelian simple group G given by the degree of G if G is an alternating group, or the Lie type, Lie rank and order of the underlying field if G is a group of Lie type.
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
求助内容：
应助结果提醒方式：
扫码关注我们
