Back to matchesWe found a matchYour institution may have access to this item. Find your institution then sign in to continue.TitleOn computing the closures of solvable permutation groups.AuthorsPonomarenko, Ilia; Vasil'ev, Andrey V.AbstractLet 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 n O (m) .SubjectsSOLVABLE groups; PERMUTATION groups; PERMUTATIONS; INTEGERSPublicationInternational Journal of Algebra & Computation, 2024, Vol 34, Issue 1, p137ISSN0218-1967Publication typeArticleDOI10.1142/S0218196724500036