The diameter of the symmetric group: ideas and tools

Add to your list(s) Download to your calendar using vCal

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

If you have a question about this talk, please contact INI IT.

NPCW04 - Approximation, deformation, quasification

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 <sup>"> . 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)</sup>(4+epsilon))). We will discuss a recent, much simplified version of the proof. 

This talk is part of the Isaac Newton Institute Seminar Series series.

This talk is included in these lists:

• All CMS events
• Featured lists
• INI info aggregator
• Isaac Newton Institute Seminar Series
• School of Physical Sciences
• Seminar Room 1, Newton Institute
• bld31

Note that ex-directory lists are not shown.