Generation of polycyclic groups
| dc.creator | Kassabov, Martin | |
| dc.creator | Nikolov, Nikolay | |
| dc.date | 2007-11-21 | |
| dc.date | 2008-03-27 | |
| dc.date.accessioned | 2026-07-07T09:28:35Z | |
| dc.date.available | 2026-07-07T09:28:35Z | |
| dc.description | In this note we give an alternative proof of a theorem of Linnell and Warhurst that the number of generators d(G) of a polycyclic group G is at most d(\hat G), where d(\hat G) is the number of generators of the profinite completion of G. While not claiming anything new we believe that our argument is much simpler that the original one. Moreover our result gives some sufficient condition when d(G)=d(\hat G) which can be verified quite easily in the case when G is virtually abelian. | |
| dc.description | 9 pages, some small mistakes in the first version have been corrected | |
| dc.identifier | https://arxiv.org/abs/0711.3440 | |
| dc.identifier | http://arxiv.org/abs/0711.3440 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/157475 | |
| dc.subject | Group Theory | |
| dc.title | Generation of polycyclic groups | |
| dc.type | text |