The Time Complexity Of Some Algorithms For Generating The Spectra Of Finite Simple Groups Full article
| Journal |
Сибирские электронные математические известия (Siberian Electronic Mathematical Reports)
, E-ISSN: 1813-3304 |
||
|---|---|---|---|
| Output data | Year: 2022, Volume: 19, Number: 1, Pages: 101-108 Pages count : 8 DOI: 10.33048/semi.2022.19.009 | ||
| Tags | Algorithm; Finite simple group; Spectrum; Time complexity | ||
| Authors |
|
||
| Affiliations |
|
Funding (1)
| 1 |
Министерство науки и высшего образования РФ Mathematical Center in Akademgorodok |
075-15-2019-1613, 075-15-2022-281 |
Abstract:
The spectrum ω(G) is the set of orders of elements of a finite group 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.
Cite:
Buturlakin A.A.
The Time Complexity Of Some Algorithms For Generating The Spectra Of Finite Simple Groups
Сибирские электронные математические известия (Siberian Electronic Mathematical Reports). 2022. V.19. N1. P.101-108. DOI: 10.33048/semi.2022.19.009 WOS Scopus РИНЦ OpenAlex
The Time Complexity Of Some Algorithms For Generating The Spectra Of Finite Simple Groups
Сибирские электронные математические известия (Siberian Electronic Mathematical Reports). 2022. V.19. N1. P.101-108. DOI: 10.33048/semi.2022.19.009 WOS Scopus РИНЦ OpenAlex
Identifiers:
| Web of science: | WOS:000762938900009 |
| Scopus: | 2-s2.0-85126829380 |
| Elibrary: | 49384621 |
| OpenAlex: | W3201913597 |
Citing:
Пока нет цитирований