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

DOI10.33048/SEMI.2022.19.009MaRDI QIDQ2667896zbMATH OpenOpenAlexFDO

Authors A. A. Buturlakin

Publication date 2 March 2022

Published in Sibirskie Elektronnye Matematicheskie Izvestiya (Search for Journal in Brave)

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

zbMATH Keywords

algorithmfinite simple groupspectrumtime complexity

Mathematics Subject Classification ID

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

Abstract: The spectrum $omega(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.

Recommendations

• The graph of atomic divisors and recognition of finite simple groups
• Spectra of finite symplectic and orthogonal groups.
• Recognition by spectrum for finite simple groups of Lie type.
• Spectra of finite simple groups E₆(q) and ^2E₆(q).
• Finite groups isospectral to simple groups

Cites work

• 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
• Spectra of finite linear and unitary groups

Cited in

(1)

• The graph of atomic divisors and recognition of finite simple groups

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2667896)