A finitary version of Gromov's polynomial growth theorem.

From MaRDI portal
Publication:616155

DOI10.1007/S00039-010-0096-1zbMATH Open1262.20044arXiv0910.4148OpenAlexW2124868377WikidataQ56386406 ScholiaQ56386406MaRDI QIDQ616155FDOQ616155


Authors: Yehuda Shalom, Terence Tao Edit this on Wikidata


Publication date: 7 January 2011

Published in: Geometric and Functional Analysis. GAFA (Search for Journal in Brave)

Abstract: 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 R0>exp(exp(CdC)) for which the number of elements in a ball of radius R0 in a Cayley graph of G is bounded by R0d, then G has a finite index subgroup which is nilpotent (of step <Cd). 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.


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




Recommendations




Cites Work


Cited In (42)





This page was built for publication: A finitary version of Gromov's polynomial growth theorem.

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