Membership problems for positive one-relator groups and one-relation monoids

Foniqi, Islam ORCID: https://orcid.org/0000-0002-0829-3464, Gray, Robert D. and Nyberg-Brodda, Carl-Fredrik (2024) Membership problems for positive one-relator groups and one-relation monoids. Canadian Journal Of Mathematics-Journal Canadien De Mathematiques. ISSN 0008-414X (In Press)

Preview

PDF (FoniqiGrayNybergBroddaPositiveArxivV2July2024) - Accepted Version Download (477kB) | Preview

Abstract

Motivated by approaches to the word problem for one-relation monoids arising from work of Adian and Oganesian (1987), Guba (1997), and Ivanov, Margolis and Meakin (2001), we study the submonoid and rational subset membership problems in one-relation monoids and in positive one-relator groups. We give the first known examples of positive one-relator groups with undecidable submonoid membership problem, and apply this to give the first known examples of one-relation monoids with undecidable submonoid membership problem. We construct several infinite families of one-relation monoids with undecidable submonoid membership problem, including examples that are defined by relations of the form $w=1$ but which are not groups, and examples defined by relations of the form $u=v$ where both of $u$ and $v$ are non-empty. As a consequence we obtain a classification of the right-angled Artin groups that can arise as subgroups of one-relation monoids. We also give examples of monoids with a single defining relation of the form $aUb = a$, and examples of the form $aUb=aVa$, with undecidable rational subset membership problem. We give a one-relator group defined by a freely reduced word of the form $uv^{-1}$ with $u, v$ positive words, in which the prefix membership problem is undecidable. Finally, we prove the existence of a special two-relator inverse monoid with undecidable word problem, and in which both the relators are positive words. As a corollary, we also find a positive two-relator group with undecidable prefix membership problem. In proving these results, we introduce new methods for proving undecidability of the rational subset membership problem in monoids and groups, including by finding suitable embeddings of certain trace monoids.

Item Type:	Article
Additional Information:	Funding information: The research of the first two named authors was supported by the EPSRC Fellowship grant EP/V032003/1 ‘Algorithmic, topological and geometric aspects of infinite groups, monoids and inverse semigroups
Faculty \ School:	Faculty of Science > School of Mathematics (former - to 2024)
UEA Research Groups:	Faculty of Science > Research Groups > Algebra and Combinatorics (former - to 2024) Faculty of Science > Research Groups > Logic (former - to 2024) Faculty of Science > Research Groups > Algebra, Logic & Number Theory
Related URLs:	https://www.cambridge.org/core/journals/... http://arxiv.org/pdf/2305.15672v1
Depositing User:	LivePure Connector
Date Deposited:	13 Jun 2023 08:59
Last Modified:	14 Nov 2024 00:52
URI:	https://ueaeprints.uea.ac.uk/id/eprint/92380
DOI:

Downloads

Actions (login required)

View Item