2012/05/08 by John Bamberg, Bamberg, John, Nick Gill +9
Engineering · Mathematics · #Advanced Combinatorial Mathematics #Combinatorics (math.CO) #FOS: Mathematics #Finite Group Theory Research #Group Theory (math.GR) #graph theory and CDMA systems
paper · doi:10.48550/arxiv.1205.1596
openalex publication_date 2012/05/08 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/30
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.