Skip to main navigation Skip to search Skip to main content

Bounds on the diameter of Cayley graphs of the symmetric group

  • John Bamberg
  • , Nick Gill
  • , Thomas P. Hayes
  • , Harald A. Helfgott
  • , Ákos Seress
  • , Pablo Spiga
  • University of Western Australia
  • Open University Milton Keynes
  • École Normale Supérieure
  • Ohio State University
  • University of Milan - Bicocca

Research output: Contribution to journalArticlepeer-review

7 Scopus citations

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 languageEnglish
Pages (from-to)1-22
Number of pages22
JournalJournal of Algebraic Combinatorics
Volume40
Issue number1
DOIs
StatePublished - 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