Files in this item
Todd-Coxeter methods for inverse monoids
Item metadata
dc.contributor.advisor | Robertson, E. F. | |
dc.contributor.advisor | Atkinson, M.D. | |
dc.contributor.author | Cutting, Andrew | |
dc.coverage.spatial | 161 p. | en_US |
dc.date.accessioned | 2018-07-06T11:48:53Z | |
dc.date.available | 2018-07-06T11:48:53Z | |
dc.date.issued | 2001 | |
dc.identifier.uri | https://hdl.handle.net/10023/15052 | |
dc.description.abstract | Let P be the inverse monoid presentation (X|U) for the inverse monoid M, let π be the set of generators for a right congruence on M and let u Є M. Using the work of J. Stephen [15], the current work demonstrates a coset enumeration technique for the R-class Rᵤ similar to the coset enumeration algorithm developed by J. A. Todd and H. S. M. Coxeter for groups. Furthermore it is demonstrated how to test whether Rᵤ = Rᵥ, for u, v Є M and so a technique for enumerating inverse monoids is described. This technique is generalised to enumerate the H-classes of M. The algorithms have been implemented in GAP 3.4.4 [25], and have been used to analyse some examples given in Chapter 6. The thesis concludes by a related discussion of normal forms and automaticity of free inverse semigroups. | en_US |
dc.language.iso | en | en_US |
dc.publisher | University of St Andrews | en |
dc.subject.lcc | QA171.M7C9 | |
dc.title | Todd-Coxeter methods for inverse monoids | en_US |
dc.type | Thesis | en_US |
dc.contributor.sponsor | Engineering and Physical Sciences Research Council (EPSRC) | en_US |
dc.type.qualificationlevel | Doctoral | en_US |
dc.type.qualificationname | PhD Doctor of Philosophy | en_US |
dc.publisher.institution | The University of St Andrews | en_US |
This item appears in the following Collection(s)
Items in the St Andrews Research Repository are protected by copyright, with all rights reserved, unless otherwise indicated.