The asymptotic density of finite-order elements in virtually nilpotent groups. (Q2460803): Difference between revisions

Let \(G\) be a finitely generated group, and let \(S\) be a finite set of generators for \(G\). If \(x\) and \(y\) are elements of \(G\), set \(d(x,y)\) to be the length of the shortest word in \(S\) representing \(x^{-1}y\). In this way we define the `word metric' on \(G\), which makes \(G\) into a discrete, proper metric space. For \(r\geq 1\), denote by \(B_S(r)\) the ball of radius \(r\) centred at the identity of \(G\) with respect to this metric. Moreover, let \(E_S(r)\) be the set of elements of finite order of \(G\) which belong to \(B_S(r)\). The `asymptotic density' of elements of finite order of \(G\) is the limit \(D(G,S)\) (if it exists), as \(r\) runs to \(\infty\), of \(\tfrac{|E_S(r)|}{|B_S(r)|}\). In the article under review the author obtains a formula to compute \(D(G,S)\) in the case that \(G\) is a `nilpotent-by-finite' group (see Theorem 1.1). Note that if \(G\) is nilpotent, as the finite-order elements of \(G\) form a finite subgroup, then \(D(G,S)=0\). This formula shows in particular that \(D(G,S)\) is a rational number independent of the generating set \(S\) (so it is possible to write \(D(G)\) instead of \(D(G,S)\)). Moreover, it is used to compute \(D(G)\) when \(G\) is a `crystallographic group' in dimensions 2, 3 and 4, respectively (recall that such groups are Abelian-by-finite by Bieberbach's First Theorem). Finally, the author proves (see Theorem 1.3) that given any rational number \(p/q\in[0,1)\), there exists a crystallographic group \(G\) such that \(D(G)=p/q\).