The University of Southampton
University of Southampton Institutional Repository

Generation of polycyclic groups

Generation of polycyclic groups
Generation of polycyclic groups
We give a new and self-contained proof of a theorem of Linnell and Warhurst that d(G) – d(?) 1 for finitely generated virtually torsion-free soluble minimax groups G. We also give a simple sufficient condition for the equality d(G) = d(?) to hold when G is virtually abelian.
1433-5883
567-577
Kassabov, Martin
b78efbac-c468-4838-ac56-5f23181f595c
Nikolov, Nikolay
1e087391-9019-4753-ae22-0a4807e15c7b
Kassabov, Martin
b78efbac-c468-4838-ac56-5f23181f595c
Nikolov, Nikolay
1e087391-9019-4753-ae22-0a4807e15c7b

Kassabov, Martin and Nikolov, Nikolay (2009) Generation of polycyclic groups. Journal of Group Theory, 12 (4), 567-577. (doi:10.1515/JGT.2008.098).

Record type: Article

Abstract

We give a new and self-contained proof of a theorem of Linnell and Warhurst that d(G) – d(?) 1 for finitely generated virtually torsion-free soluble minimax groups G. We also give a simple sufficient condition for the equality d(G) = d(?) to hold when G is virtually abelian.

Text
Generation_of_polycyclic_groups.pdf - Version of Record
Restricted to Repository staff only

More information

Submitted date: March 2008
Published date: July 2009

Identifiers

Local EPrints ID: 155171
URI: http://eprints.soton.ac.uk/id/eprint/155171
ISSN: 1433-5883
PURE UUID: 6dab691d-2e49-47bc-8ec6-88fff687cb77

Catalogue record

Date deposited: 27 May 2010 11:17
Last modified: 14 Mar 2024 01:37

Export record

Altmetrics

Contributors

Author: Martin Kassabov
Author: Nikolay Nikolov

Download statistics

Downloads from ePrints over the past year. Other digital versions may also be available to download e.g. from the publisher's website.

View more statistics

Atom RSS 1.0 RSS 2.0

Contact ePrints Soton: eprints@soton.ac.uk

ePrints Soton supports OAI 2.0 with a base URL of http://eprints.soton.ac.uk/cgi/oai2

This repository has been built using EPrints software, developed at the University of Southampton, but available to everyone to use.

We use cookies to ensure that we give you the best experience on our website. If you continue without changing your settings, we will assume that you are happy to receive cookies on the University of Southampton website.

×