skip to content

Mathematical Research at the University of Cambridge

 

Let G= be a finitely generated group, and let \gamma_X(n) be the cardinality of the n-radius ball in the corresponding Cayley graph. In 1981, Gromov famously proved that \gamma_X(n) is polynomially bounded if and only if G is virtually nilpotent. After discovering groups of intermediate growth in 1984, Grigorchuk conjectured that all non-virtually nilpotent groups satisfy \gamma_X(n) > exp(n^\eps).


When G is finite it is more natural to consider the diameter, i.e. the minimum n such that \gamma_X(n) = |G|. A well-known conjecture of Babai predicts that the diameter of nonabelian finite simple groups is bounded by a polylogarithm in the order of the group. In this talk, we show that Babai’s conjecture implies the Grigorchuk gap conjecture for residually finite groups. This is joint work with Sean Eberhard, Elena Maini, and Gareth Tracey.


Further information

Time:

20Nov
Nov 20th 2026
13:45 to 15:00

Venue:

MR13

Speaker:

Luca Sabatini (Warwick)

Series:

Geometric Group Theory (GGT) Seminar