Papers
Topics
Authors
Recent
Search
2000 character limit reached

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

Published 11 Feb 2019 in math.GR | (1902.03822v3)

Abstract: We prove the following results: (1) There is a one-relator inverse monoid $\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.

Summary

Paper to Video (Beta)

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Authors (1)

Collections

Sign up for free to add this paper to one or more collections.