Approximating a group by its solvable quotients.

From MaRDI portal
Publication:416765

zbMATH Open1243.20038arXiv1102.4030MaRDI QIDQ416765FDOQ416765


Authors: Khalid Bou-Rabee Edit this on Wikidata


Publication date: 10 May 2012

Published in: The New York Journal of Mathematics (Search for Journal in Brave)

Abstract: The solvable Farb growth of a group quantifies how well-approximated the group is by its finite solvable quotients. In this note we present a new characterization of polycyclic groups which are virtually nilpotent. That is, we show that a group has solvable Farb growth which is at most polynomial in log(n) if and only if the group is polycyclic and virtually nilpotent. We also give new results concerning approximating oriented surface groups by nilpotent quotients. As a consequence of this, we prove that a natural number C exists so that any nontrivial element of the Ckth term of the lower central series of a finitely generated oriented surface group must have word length at least k. Here C depends only on the choice of generating set. Finally, we give some results giving new lower bounds for the solvable Farb growth of some metabelian groups (including the Lamplighter groups).


Full work available at URL: https://arxiv.org/abs/1102.4030

File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)



Recommendations





Cited In (7)





This page was built for publication: Approximating a group by its solvable quotients.

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q416765)