Skip Navigation



Bulletin of the London Mathematical Society Advance Access published online on April 1, 2008

Bulletin of the London Mathematical Society, doi:10.1112/blms/bdn007
This Article
Right arrow FREE Full Text (PDF) Freely available
Right arrow All Versions of this Article:
40/2/274    most recent
bdn007v1
Right arrow Alert me when this article is cited
Right arrow Alert me if a correction is posted
Services
Right arrow Email this article to a friend
Right arrow Similar articles in this journal
Right arrow Alert me to new issues of the journal
Right arrow Add to My Personal Archive
Right arrow Download to citation manager
Right arrowRequest Permissions
Google Scholar
Right arrow Articles by Eick, B.
Right arrow Articles by Leedham-Green, C.
Social Bookmarking
 Add to CiteULike   Add to Connotea   Add to Del.icio.us  
What's this?

© 2008 London Mathematical Society

On the classification of prime-power groups by coclass

Bettina Eick

Institut Computational Mathematics
Universität Braunschweig
38106 Braunschweig
Germany

Charles Leedham-Green

School of Mathematical Sciences
Queen Mary University
London
E1 4NS
United Kingdom
C.R.Leedham-Green@qmul.ac.uk

Received 26 January 2007. Revision received 26 October 2007.

By giving a constructive proof of Conjecture P of Newman and O’Brien, we reduce the classification of certain p-groups of coclass r to a finite calculation. For the case p=2 we show that all 2-groups of coclass r can be classified by finitely many parametrised presentations. A non-constructive proof of Conjecture P was given by du Sautoy, using the theory of zeta functions. Our constructive proof uses homological algebra. It yields more precise results and detailed structure theorems for the p-groups under consideration.


2000 Mathematics Subject Classification 20D15, 20E22, 20J05.


Add to CiteULike CiteULike   Add to Connotea Connotea   Add to Del.icio.us Del.icio.us    What's this?




Disclaimer:
Please note that abstracts for content published before 1996 were created through digital scanning and may therefore not exactly replicate the text of the original print issues. All efforts have been made to ensure accuracy, but the Publisher will not be held responsible for any remaining inaccuracies. If you require any further clarification, please contact our Customer Services Department.