Polynomial growth of a group

A finitely generated group has polynomial growth when, for some constants $C,D$, its growth function of a finitely generated group satisfiesThis property is independent of the finite generating set $S$.

For every $d>0$ there is $N(d)$ such that, if a group has a finite symmetric generating set $S$ containing the identity andfor some $n\ge N(d)$, then there are $H⊴C<G$ with $H\subseteq S^{\lfloor n/2\rfloor }$, $[G:C]=O_d(1)$, and $C/H$ nilpotent of class $O_d(1)$. A geometric-scale pigeonhole argument finds a large radius of small tripling, and the Breuillard-Green-Tao structure theorem for approximate groups supplies $H$ and $C$.

Every finitely generated group of polynomial growth of a group has a virtually nilpotent group structure. Applying the one-scale virtual nilpotence theorem gives a finite normal subgroup with nilpotent quotient; centralizing that finite subgroup produces a nilpotent subgroup of finite index.

Every finitely generated two-step nilpotent group has polynomial growth of a group. If $s_1,\dots ,s_k$ generate it, centrality of the commutators collects every word of length at most $n$ intowhere $|a_i|\le n$ and $|b_{ij}|=O(n^2)$. There are therefore only polynomially many possible collected words.