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

On equations and first-order theory of one-relator monoids (1908.00098v2)

Published 31 Jul 2019 in math.GR and math.LO

Abstract: We investigate systems of equations and the first-order theory of one-relator monoids. We describe a family $\mathcal{F}$ of one-relator monoids of the form $\langle A\mid w=1\rangle$ where for each monoid $M$ in $\mathcal{F}$, the longstanding open problem of decidability of word equations with length constraints reduces to the Diophantine problem (i.e.\ decidability of systems of equations) in $M$. We achieve this result by finding an interpretation in $M$ of a free monoid, using only systems of equations together with length relations. It follows that each monoid in $\mathcal{F}$ has undecidable positive AE-theory, hence in particular it has undecidable first-order theory. The family $\mathcal{F}$ includes many one-relator monoids with torsion $\langle A\mid wn = 1\rangle$ ($n>1$). In contrast, all one-relator groups with torsion are hyperbolic, and all hyperbolic groups are known to have decidable Diophantine problem. We further describe a different class of one-relator monoids with decidable Diophantine problem.

Summary

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