Generation of polycyclic groups

Mathematics – Group Theory

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

9 pages, some small mistakes in the first version have been corrected

Scientific paper

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.

No associations

LandOfFree

Say what you really think

Search LandOfFree.com for scientists and scientific papers. Rate them and share your experience with other people.

Rating

Generation of polycyclic groups does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Generation of polycyclic groups, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Generation of polycyclic groups will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-O-414865

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.