Near-Optimal Expanding Generating Sets for Solvable Permutation Groups

V. Arvind, Partha Mukhopadhyay, Prajakta Nimbhorkar +1

Let $G=<S>$ be a solvable permutation group of the symmetric group $S_n$ given as input by the generating set $S$. We give a deterministic polynomial-time algorithm that computes…