arXiv Analytics

Sign in

arXiv:1911.06571 [math.GR]AbstractReferencesReviewsResources

New results on the prefix membership problem for one-relator groups

Igor Dolinka, Robert D. Gray

Published 2019-11-15Version 1

In this paper we prove several results regarding decidability of the membership problem for certain submonoids in amalgamated free products and HNN extensions of groups. These general results are then applied to solve the prefix membership problem for a number of classes of one-relator groups which are low in the Magnus-Moldavanski\u{\i} hierarchy. Since the prefix membership problem for one-relator groups is intimately related to the word problem for one-relator special inverse monoids in the $E$-unitary case (as discovered in 2001 by Ivanov, Margolis and Meakin), these results yield solutions of the word problem for several new classes of one-relator special inverse monoids. In establishing these results, we introduce a new theory of conservative factorisations of words which provides a link between the prefix membership problem of a one-relator group and the group of units of the corresponding one-relator special inverse monoid. Finally, we exhibit the first example of a one-relator group, defined by a reduced relator word, that has an undecidable prefix membership problem.

Related articles: Most relevant | Search more
arXiv:2412.03264 [math.GR] (Published 2024-12-04)
The word problem of finitely presented special inverse monoids via their groups of units
arXiv:2403.11148 [math.GR] (Published 2024-03-17)
The word problem and growth of groups
arXiv:2003.10568 [math.GR] (Published 2020-03-23)
Free idempotent generated semigroups: The word problem and structure via gain graphs