The University of Southampton
University of Southampton Institutional Repository

Proper decompositions of finitely presented groups

Proper decompositions of finitely presented groups
Proper decompositions of finitely presented groups
For a finitely presented group G, determining whether it admits a proper decomposition as an amalgamated free product or HNN-extension is often not straightforward. In a presentation 2-complex for G, there are special subsets called patterns and tracks. Bass-Serre theory and van Kampen's theorem show that given such a G, there exists a proper decomposition if and only if there exists a track that determines a proper decomposition. With this in mind, an original algorithm is constructed here to find a basis set of patterns, such that every pattern is a unique rational linear combination of these basis patterns. Another desirable pattern to determine for such a G is a maximal set of disjoint tracks (or MSD). Here we construct an algorithm to generate an MSD for a finitely presented group G, or terminate early providing a track that gives a proper decomposition of G. Part of this algorithm includes the proof that if a group, not immediately obviously admitting a proper decomposition, has a proper decomposition as an HNN-extension, then the algorithm will find a track providing such a proper decomposition. The concepts of basis patterns and MSDs were developed after the counter-example given here to the main conjecture of A.N. Bartholomew's Proper Decompositions Of Finitely Presented Groups (1987), that the sum of two tracks giving trivial decompositions gives a trivial decomposition itself, was discovered. A proof is given using Bass-Serre theory on a certain class of groups that if every track in an MSD determines certain trivial decompositions of G, then G has no proper splitting over a finite subgroup. One of the main aims of this research was to provide a computer program dealing with patterns. This has been achieved with the program Presentation accompanying this thesis. It enables easy manipulation and graphical display of patterns, and allows many operations to be performed on them. Also both algorithms given in the thesis are implemented. It is hoped that the theory of patterns will be advanced by this new accessibilty.
Barker, Tom A.P.
6aafabdc-fc69-4cee-a6b2-a15e0039fefb
Barker, Tom A.P.
6aafabdc-fc69-4cee-a6b2-a15e0039fefb

Barker, Tom A.P. (2000) Proper decompositions of finitely presented groups. University of Southampton, Department of Mathematics, Doctoral Thesis, 190pp.

Record type: Thesis (Doctoral)

Abstract

For a finitely presented group G, determining whether it admits a proper decomposition as an amalgamated free product or HNN-extension is often not straightforward. In a presentation 2-complex for G, there are special subsets called patterns and tracks. Bass-Serre theory and van Kampen's theorem show that given such a G, there exists a proper decomposition if and only if there exists a track that determines a proper decomposition. With this in mind, an original algorithm is constructed here to find a basis set of patterns, such that every pattern is a unique rational linear combination of these basis patterns. Another desirable pattern to determine for such a G is a maximal set of disjoint tracks (or MSD). Here we construct an algorithm to generate an MSD for a finitely presented group G, or terminate early providing a track that gives a proper decomposition of G. Part of this algorithm includes the proof that if a group, not immediately obviously admitting a proper decomposition, has a proper decomposition as an HNN-extension, then the algorithm will find a track providing such a proper decomposition. The concepts of basis patterns and MSDs were developed after the counter-example given here to the main conjecture of A.N. Bartholomew's Proper Decompositions Of Finitely Presented Groups (1987), that the sum of two tracks giving trivial decompositions gives a trivial decomposition itself, was discovered. A proof is given using Bass-Serre theory on a certain class of groups that if every track in an MSD determines certain trivial decompositions of G, then G has no proper splitting over a finite subgroup. One of the main aims of this research was to provide a computer program dealing with patterns. This has been achieved with the program Presentation accompanying this thesis. It enables easy manipulation and graphical display of patterns, and allows many operations to be performed on them. Also both algorithms given in the thesis are implemented. It is hoped that the theory of patterns will be advanced by this new accessibilty.

Text
00181389.pdf - Other
Restricted to Repository staff only

More information

Published date: October 2000
Organisations: University of Southampton

Identifiers

Local EPrints ID: 50631
URI: http://eprints.soton.ac.uk/id/eprint/50631
PURE UUID: 20cfbb64-ca9a-49b3-866f-f9f3579ab771

Catalogue record

Date deposited: 06 Apr 2008
Last modified: 13 Mar 2019 20:50

Export record

Contributors

Author: Tom A.P. Barker

University divisions

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.

×