![[Search]](/static/images/search.gif){kind=small}
![[A-Z Index]](/static/images/az.gif){kind=small}
![[Contact]](/static/images/contact.gif){kind=small}
![[University of Cambridge]](/static/images/identifier2.gif){kind=small}
![[Talks.cam]](/static/images/talkslogosmall.gif)
Peter Keevash (Oxford)
Thursday 26 February 2026, 14:30-15:30
The diameter of somewhat dense Cayley graphs on $A_n$
- 👤 Speaker: Peter Keevash (Oxford)
- 📅 Date & Time: Thursday 26 February 2026, 14:30 - 15:30
- 📍 Venue: MR12
Abstract
A fundamental open problem on the geometry of Cayley graphs is Babai’s Diameter Conjecture, which states that the diameter of any connected Cayley graph on a nonabelian finite simple group $G$ is at most polylogarithmic in $|G|$. A natural extremal variant, also open in general, asks for the maximum possible diameter given the density of the generating set. In this talk, we consider the alternating permutation groups $A_n$, for which Helfgott and Seress showed that the diameter of any Cayley graph is at most quasipolynomial in $n$. We will present an essentially optimal upper bound on the diameter when the density of the generating set is at least $2^{-O(n)}$. Our proof combines combinatorial, analytic and algebraic arguments, with the key ingredient being a new sharp hypercontractive inequality in $S_n$. This is joint work with Noam Lifshitz.
Series This talk is part of the Combinatorics Seminar series.
Included in Lists
- All CMS events
- All Talks (aka the CURE list)
- bld31
- CMS Events
- Combinatorics Seminar
- DPMMS info aggregator
- DPMMS lists
- DPMMS Lists
- DPMMS Pure Maths Seminar
- Hanchen DaDaDash
- Interested Talks
- MR12
- School of Physical Sciences
Note: Ex-directory lists are not shown.