Abstract
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.
| Original language | English |
|---|---|
| Pages (from-to) | 1-22 |
| Number of pages | 22 |
| Journal | Journal of Algebraic Combinatorics |
| Volume | 40 |
| Issue number | 1 |
| DOIs | |
| State | Published - Aug 2014 |
Keywords
- Babai's conjecture
- Babai-Seress conjecture
- Cayley graph
- Diameter
Fingerprint
Dive into the research topics of 'Bounds on the diameter of Cayley graphs of the symmetric group'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver