Bounds on the diameter of Cayley graphs of the symmetric group

John Bamberg, Nick Gill, Thomas Hayes, Harald Helfgott, Ákos Seress, Pablo Spiga

Allbwn ymchwil: Cyfraniad at gyfnodolynErthygladolygiad gan gymheiriaid

83 Wedi eu Llwytho i Lawr (Pure)

Crynodeb

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.
Iaith wreiddiolSaesneg
Tudalennau (o-i)1-22
Nifer y tudalennau22
CyfnodolynJournal of Algebraic Combinatorics
Cyfrol40
Rhif cyhoeddi1
Dynodwyr Gwrthrych Digidol (DOIs)
StatwsCyhoeddwyd - 2014

Ôl bys

Gweld gwybodaeth am bynciau ymchwil 'Bounds on the diameter of Cayley graphs of the symmetric group'. Gyda’i gilydd, maen nhw’n ffurfio ôl bys unigryw.

Dyfynnu hyn