Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
173 tokens/sec
GPT-4o
7 tokens/sec
Gemini 2.5 Pro Pro
46 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

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

Published 11 Feb 2019 in math.GR

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

We haven't generated a summary for this paper yet.