Grigorchuk's gap conjecture for finitely generated groups

At least 14 years old · documented by

Let G=⟨X⟩G=\langle X\rangle be a group generated by a finite set XX, with growth function

γX(n)=∣BX(n)∣,BX(n)={g∈G:ℓX(g)≤n}.\gamma_X(n)=|B_X(n)|,\qquad B_X(n)=\{g\in G:\ell_X(g)\leq n\}.

Write f≺gf\prec g for the growth comparison used in the source: there is a constant C>0C>0 such that f(n)≤Cg(Cn)f(n)\leq Cg(Cn) for all n>0n>0. A group is virtually nilpotent if it has a nilpotent subgroup of finite index. Grigorchuk’s gap conjecture. There is a constant β>0\beta>0 such that, if

γX(n)≺exp⁡(nβ),\gamma_X(n)\prec\exp(n^\beta),

then GG is virtually nilpotent.

This conjecture asks for a gap between polynomial growth and sufficiently slow subexponential growth. The paper also mentions the stronger version, which asserts that one may take β=1/2\beta=1/2, and proves the conjecture for groups acting faithfully on bounded-degree rooted trees; conditional on Babai’s conjecture, it reduces the residually finite case to the simple case.

References

Primary source

Sean Eberhard, Elena Maini, Luca Sabatini and Gareth Tracey, “Diameter bounds for arbitrary finite groups and applications”, arXiv:2604.15303 (2026).

Additional references

4 papers in this index state this conjecture (2011–2026). The statement above is taken from the most recent of them; the others are arXiv:2511.07018, arXiv:2503.05572, arXiv:1111.0512.

Progress summary

Never refreshed

Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.

Solutions 0

No solutions have been posted yet.