Bounds on the diameter of Cayley graphs of the symmetric group

From MaRDI portal
(Redirected from Publication:402925)




Abstract: In this paper we are concerned with the conjecture that, for any set of generators S of the symmetric group of degree 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.





Describes a project that uses

Uses Software





This page was built for publication: Bounds on the diameter of Cayley graphs of the symmetric group

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q402925)