The diameter of the symmetric group: ideas and tools
- 👤 Speaker: Harald Helfgott (Université Paris 7 - Denis-Diderot; Georg-August-Universität Göttingen)
- 📅 Date & Time: Thursday 11 May 2017, 14:30 - 15:30
- 📍 Venue: Seminar Room 1, Newton Institute
Abstract
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.
Series This talk is part of the Isaac Newton Institute Seminar Series series.
Included in Lists
- All CMS events
- bld31
- dh539
- Featured lists
- INI info aggregator
- Isaac Newton Institute Seminar Series
- School of Physical Sciences
- Seminar Room 1, Newton Institute
Note: Ex-directory lists are not shown.
![[Talks.cam]](/static/images/talkslogosmall.gif)

Harald Helfgott (Université Paris 7 - Denis-Diderot; Georg-August-Universität Göttingen)
Thursday 11 May 2017, 14:30-15:30