#5811 ⟨a, b | abaaab=aaaba⟩
Quick links
- Properties
- Rewriting system
- Presentation has sum-of-sides 11
- Infinite non-cancellative non-commutative monoid
- Not left cancellative, because left multiplication by a is not injective:
-
a ⋅ ba3b = a3ba and a ⋅ a2ba = a3ba, however ba3b ≠ a2ba
- Enveloping group: ⟨a, b | aabab-1b-1⟩
- Auxiliary generators:
- c = ab
- d = cc
- e = aa
- f = ec
- g = de
- Reduction order:
- Left-to-right recursive path with deg(d) = deg(f) = deg(g) = 0, d < f < g; deg(e) = 1; deg(c) = 2; deg(a) = 3; deg(b) = 4
- Certificate: derivations of all rewriting rules from the defining relations.
- Morphocompletion: how the auxiliary generators were found.
# ab:abaaab=aaaba dfg/e/c/a/b ab=c,cc=d,aa=e,ec=f,de=g morph:2/1,2/0,2/0,2/0,2/1
gd=ff
fdf=gg
gfff=fdgg
de=g
fe=df
gge=fddf
dc=cd
fc=ed
gc=df
ec=f
cc=d
fa=cf
ga=dae
ea=ae
aa=e
gb=dac
dfb=ced
ffb=eed
ggfb=fged
eb=ac
cfb=ed
ab=c