A Finitary Version of Gromov’s Polynomial Growth Theorem
Skip to main content
Open Access Publications from the University of California


UCLA Previously Published Works bannerUCLA

A Finitary Version of Gromov’s Polynomial Growth Theorem

  • Author(s): Shalom, Yehuda;
  • Tao, Terence
  • et al.

We show that for some absolute (explicit) constant C, the following holds for every finitely generated group G, and all d > 0: If there is some R 0 > exp(exp(Cd C )) for which the number of elements in a ball of radius R 0 in a Cayley graph of G is bounded by $${R_0^d}$$ , then G has a finite-index subgroup which is nilpotent (of step < C d ). An effective bound on the finite index is provided if “nilpotent” is replaced by “polycyclic”, thus yielding a non-trivial result for finite groups as well.

Many UC-authored scholarly publications are freely available on this site because of the UC's open access policies. Let us know how this access is important for you.

Main Content
For improved accessibility of PDF content, download the file to your device.
Current View