**Papers Published**

- Brito, G; Fowler, C; Junge, M; Levy, A,
*Ewens Sampling and Invariable Generation*, Combinatorics, Probability and Computing, vol. 27 no. 6 (November, 2018), pp. 853-891, Cambridge University Press (CUP)

(last updated on 2019/05/19)**Abstract:**

© 2018 Cambridge University Press. We study the number of random permutations needed to invariably generate the symmetric group Sn when the distribution of cycle counts has the strong α-logarithmic property. The canonical example is the Ewens sampling formula, for which the special case α = 1 corresponds to uniformly random permutations. For strong α-logarithmic measures and almost every α, we show that precisely [(1-αlog2)-1] permutations are needed to invariably generate Sn with asymptotically positive probability. A corollary is that for many other probability measures on Sn no fixed number of permutations will invariably generate Sn with positive probability. Along the way we generalize classic theorems of ErdÅ's, Tehran, Pyber, Łuczak and Bovey to permutations obtained from the Ewens sampling formula.