pith. sign in

arxiv: 1302.0982 · v1 · pith:HNREVLPKnew · submitted 2013-02-05 · 🧮 math.GR

Monoids Monlangle a,b:a^(α)b^(β)a^(γ)b^(δ)=brangle admit finite complete rewriting systems

classification 🧮 math.GR
keywords finitelanglemathrmranglealphabetacompletedelta
0
0 comments X
read the original abstract

We prove that every monoid $\mathrm{Mon}\langle a,b:a^{\alpha}b^{\beta}a^{\gamma}b^{\delta}=b\rangle$ admits a finite complete rewriting system. Furthermore we prove that $\mathrm{Mon}\langle a,b:ab^2a^2b^2=b\rangle$ is non-hopfian, providing an example of a finitely presented non-residually finite monoid with linear Dehn function.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.