On computing the closures of solvable permutation groups

Abstract

Let $m\ge 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)}$.

7 pages

References in corpus (2)

• Two-closure of supersolvable permutation group in polynomial time
• The $3$-closure of a solvable permutation group is solvable

Cited by in corpus (1)

• Closures of permutation groups with restricted nonabelian composition factors