Prefer a chat interface with context about you and your work?
On computing the closures of solvable permutation groups
Let [Formula: see text] be an integer. It is proved that the m-closure of a given solvable permutation group of degree n can be constructed in time [Formula: see text].