Files in this item
Subsemigroups of virtually free groups : finite Malcev presentations and testing for freeness
Item metadata
dc.contributor.author | Cain, AJ | |
dc.contributor.author | Robertson, Edmund Frederick | |
dc.contributor.author | Ruskuc, Nikola | |
dc.date.accessioned | 2010-12-01T15:35:16Z | |
dc.date.available | 2010-12-01T15:35:16Z | |
dc.date.issued | 2006-07 | |
dc.identifier.citation | Cain , AJ , Robertson , E F & Ruskuc , N 2006 , ' Subsemigroups of virtually free groups : finite Malcev presentations and testing for freeness ' , Mathematical Proceedings of the Cambridge Philosophical Society , vol. 141 , no. 1 , pp. 57-66 . https://doi.org/10.1017/S0305004106009236 | en |
dc.identifier.issn | 0305-0041 | |
dc.identifier.other | PURE: 288113 | |
dc.identifier.other | PURE UUID: 05de926a-9e9c-4003-9801-4207d9ecc9e9 | |
dc.identifier.other | WOS: 000239349900004 | |
dc.identifier.other | Scopus: 33745714195 | |
dc.identifier.other | ORCID: /0000-0003-2415-9334/work/73702082 | |
dc.identifier.uri | https://hdl.handle.net/10023/1561 | |
dc.description.abstract | This paper shows that, given a finite subset X of a finitely generated virtually free group F, the freeness of the subsemigroup of F generated by X can be tested algorithmically. (A group is virtually free if it contains a free subgroup of finite index.) It is then shown that every finitely generated subsemigroup, of F has a finite Malcev presentation (a type of semigroup presentation which can be used to define any semigroup that embeds in a group), and that such a presentation can be effectively found from any finite generating set. | |
dc.format.extent | 10 | |
dc.language.iso | eng | |
dc.relation.ispartof | Mathematical Proceedings of the Cambridge Philosophical Society | en |
dc.rights | (c)2006 Cambridge Philosophical Society | en |
dc.subject | Context-free languages | en |
dc.subject | QA Mathematics | en |
dc.subject.lcc | QA | en |
dc.title | Subsemigroups of virtually free groups : finite Malcev presentations and testing for freeness | en |
dc.type | Journal article | en |
dc.contributor.sponsor | EPSRC | en |
dc.description.version | Publisher PDF | en |
dc.contributor.institution | University of St Andrews. Applied Mathematics | en |
dc.contributor.institution | University of St Andrews. Pure Mathematics | en |
dc.contributor.institution | University of St Andrews. Centre for Interdisciplinary Research in Computational Algebra | en |
dc.identifier.doi | https://doi.org/10.1017/S0305004106009236 | |
dc.description.status | Peer reviewed | en |
dc.identifier.url | http://www.scopus.com/inward/record.url?scp=33745714195&partnerID=8YFLogxK | en |
dc.identifier.grantnumber | EP/C523229/1 | en |
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.