skip to content

The diameter of the symmetric group: ideas and tools

Presented by: 
Harald Helfgott
Thursday 11th May 2017 - 14:30 to 15:30
INI Seminar Room 1
Given a finite group and a set of generators, the diameter of the Cayley graph is the smallest such that every element of can be expressed as a word of length at most in ^(-) . We are concerned with bounding .

It has long been conjectured that the diameter of the symmetric group of degree is polynomially bounded in . In 2011, Helfgott and Seress gave a quasipolynomial bound (exp((log n)^(4+epsilon))). We will discuss a recent, much simplified version of the proof. 
The video for this talk should appear here if JavaScript is enabled.
If it doesn't, something may have gone wrong with our embedded player.
We'll get it fixed as soon as possible.
University of Cambridge Research Councils UK
    Clay Mathematics Institute London Mathematical Society NM Rothschild and Sons