Near-Optimal Expanding Generating Sets for Solvable Permutation Groups

Let G be a solvable subgroup of the symmetric group S_n given as input by the generating set S. We give a deterministic polynomial time algorithm that computes an expanding generating set of size \tilde{O}(n^2) for G.

Attachment