Undecidability of the word problem for one-relator inverse monoids via right-angled Artin subgroups of one-relator groups

preprint2019arXivOpen access

Abstract

We prove the following results: (1) There is a one-relator inverse monoid Inv⟨A ∣ w=1⟩\mathrm{Inv}\langle A\:|\:w=1 \rangle with undecidable word problem; and (2) There are one-relator groups with undecidable submonoid membership problem. The first of these results answers a problem originally posed by Margolis, Meakin and Stephen in 1987.

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Reviews 0

Write a reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.