On computing the closures of solvable permutation groups Full article
| Journal |
International Journal of Algebra and Computation
ISSN: 0218-1967 , E-ISSN: 1793-6500 |
||||
|---|---|---|---|---|---|
| Output data | Year: 2024, Volume: 34, Number: 1, Pages: 137-145 Pages count : 9 DOI: 10.1142/S0218196724500036 | ||||
| Tags | Permutation group; closure; polynomial-time algorithm. | ||||
| Authors |
|
||||
| Affiliations |
|
Funding (1)
| 1 | Sobolev Institute of Mathematics | FWNF-2022-0002 |
Abstract:
Let m ≥3 be an integer. It is proved that the m-closure of a given solvable permutation group of degree n can be constructed in time nO(m).
Cite:
Ponomarenko I.
, Vasil'ev A.V.
On computing the closures of solvable permutation groups
International Journal of Algebra and Computation. 2024. V.34. N1. P.137-145. DOI: 10.1142/S0218196724500036 WOS Scopus РИНЦ OpenAlex
On computing the closures of solvable permutation groups
International Journal of Algebra and Computation. 2024. V.34. N1. P.137-145. DOI: 10.1142/S0218196724500036 WOS Scopus РИНЦ OpenAlex
Dates:
| Submitted: | Apr 8, 2023 |
| Accepted: | Dec 21, 2023 |
| Published print: | Mar 7, 2024 |
| Published online: | Mar 7, 2024 |
Identifiers:
| Web of science: | WOS:001179257000007 |
| Scopus: | 2-s2.0-85187563083 |
| Elibrary: | 65813436 |
| OpenAlex: | W4390795882 |
Citing:
Пока нет цитирований