2007/11/21 by Martin Kassabov, Nikolay Nikolov, Kassabov, Martin +1
Biochemistry, Genetics and Molecular Biology · Mathematics · #Chemical Synthesis and Analysis #FOS: Mathematics #Group Theory (math.GR) #math.GR
paper · pdf · doi:10.48550/arxiv.0711.3440
9 pages, some small mistakes in the first version have been corrected
openalex publication_date 2007/11/21 · arxiv created 2008/03/27 · arxiv updated 2009/12/01 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
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( G), where d( 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( G) which can be verified quite easily in the case when G is virtually abelian.