Bounds on the diameter of Cayley graphs of the symmetric group

Abstract

In this paper we are concerned with the conjecture that, for any set of generators S of the symmetric group $\operatorname {Sym}(n)$ , the word length in terms of S of every permutation is bounded above by a polynomial of n. We prove this conjecture for sets of generators containing a permutation fixing at least 37 % of the points.