TY - JOUR
T1 - Bounds on the diameter of Cayley graphs of the symmetric group
AU - Bamberg, John
AU - Gill, N.
AU - Hayes, T.P.
AU - Helfgott, H.A.
AU - Seress, Akos
AU - Spiga, P.
PY - 2014
Y1 - 2014
N2 - In this paper we are concerned with the conjecture that, for any set of generators S of the symmetric group 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. © 2013 Springer Science+Business Media New York.
AB - In this paper we are concerned with the conjecture that, for any set of generators S of the symmetric group 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. © 2013 Springer Science+Business Media New York.
U2 - 10.1007/s10801-013-0476-3
DO - 10.1007/s10801-013-0476-3
M3 - Article
SN - 0925-9899
VL - 40
SP - 1
EP - 22
JO - Journal of Algebraic Combinatorics
JF - Journal of Algebraic Combinatorics
IS - 1
ER -