A direct consequence of Gromovs theorem is that if a group has polynomial geodesic growth with respect to some finite generating set then it is virtually nilpotent. However, until now the only examples known were virtually abelian. In this note we furnish an example of a virtually 2-step nilpotent group having polynomial geodesic growth with respect to a certain finite generating set.
We study symplectic structures on nilpotent Lie algebras. Since the classification of nilpotent Lie algebras in any dimension seems to be a crazy dream, we approach this study in case of 2-step nilpotent Lie algebras (in this sub-case also, the classification fo the dimension greater than 8 seems very difficult), using not a classification but a description of subfamilies associated with the characteristic sequence. We begin with the dimension $8$, first step where the classification becomes difficult.
We give a new proof of Gromovs theorem that any finitely generated group of polynomial growth has a finite index nilpotent subgroup. Unlike the original proof, it does not rely on the Montgomery-Zippin-Yamabe structure theory of locally compact groups.
We show that inductive limits of virtually nilpotent groups have strongly quasidiagonal C*-algebras, extending results of the first author on solvable virtually nilpotent groups. We use this result to show that the decomposition rank of the group C*-algebra of a finitely generated virtually nilpotent group $G$ is bounded by $2cdot h(G)!-1$, where $h(G)$ is the Hirsch length of $G.$ This extends and sharpens results of the first and third authors on finitely generated nilpotent groups. It then follows that if a C*-algebra generated by an irreducible representation of a virtually nilpotent group satisfies the universal coefficient theorem, it is classified by its Elliott invariant.
We prove that any Cayley graph $G$ with degree $d$ polynomial growth does not satisfy ${f(n)}$-containment for any $f=o(n^{d-2})$. This settles the asymptotic behaviour of the firefighter problem on such graphs as it was known that $Cn^{d-2}$ firefighters are enough, answering and strengthening a conjecture of Develin and Hartke. We also prove that intermediate growth Cayley graphs do not satisfy polynomial containment, and give explicit lower bounds depending on the growth rate of the group. These bounds can be further improved when more geometric information is available, such as for Grigorchuks group.