The time complexity of some algorithms for generating the spectra of finite simple groups

DOI10.33048/semi.2022.19.009zbMath1496.20041arXiv2109.12929OpenAlexW3201913597MaRDI QIDQ2667896

Aleksandr Aleksandrovich Buturlakin

Publication date: 2 March 2022

Published in: Sibirskie Èlektronnye Matematicheskie Izvestiya (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2109.12929

zbMATH Keywords

algorithmspectrumtime complexityfinite simple group

Mathematics Subject Classification ID

Arithmetic and combinatorial problems involving abstract finite groups (20D60) Simple groups: alternating groups and groups of Lie type (20D06) Computational methods for problems pertaining to group theory (20-08)

Cites Work

• Spectra of finite linear and unitary groups
• Effective Bounds for the Maximal Order of an Element in the Symmetric Group
• Majorations Explicites Pour le Nombre de Diviseurs de N
• On some problems of a statistical group-theory. IV

This page was built for publication: The time complexity of some algorithms for generating the spectra of finite simple groups