Bounds on the diameter of Cayley graphs of the symmetric group
classification
🧮 math.GR
math.CO
keywords
conjecturegeneratorsgrouppermutationsymmetricaboveboundedbounds
read the original 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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.