Bounds on the diameter of Cayley graphs of the symmetric group
Journal of Algebraic Combinatorics, 2014•Springer
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.
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.
Abstract
In this paper we are concerned with the conjecture that, for any set of generators S of the symmetric group , 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.
Springer
以上显示的是最相近的搜索结果。 查看全部搜索结果