#533 ⟨a, b | aabba=baa⟩
Quick links
- Properties
- Rewriting system
- Presentation has sum-of-sides 8
- Infinite non-cancellative non-commutative monoid
- Not right cancellative, because right multiplication by a is not injective:
-
a2b2 ⋅ a = ba2 and ba ⋅ a = ba2, however a2b2 ≠ ba
- Enveloping group: ⟨a, b | aabba-1b-1⟩
- Auxiliary generators:
- c = aabb
- d = abc
- e = abb
- Reduction order:
- Right-to-left recursive path with deg(d) = deg(c) = 0, d < c; deg(e) = 1; deg(b) = deg(a) = 2, b < a
- Certificate: derivations of all rewriting rules from the defining relations.
- Morphocompletion: how the auxiliary generators were found.
# ab:aabba=baa reversed:dc/e/ba aabb=c,abc=d,abb=e morph:4/0,3/0,3/0
ed=dce
ec=de
bd=cce
bc=ce
ead=dd
eac=dc
add=cad
adc=cac
acdd=dad
acdc=dac
ae=c
ade=cc
ace=d
acde=dc
bad=cd
bac=cc
eaa=da
ada=caa
acda=daa
abb=e
baa=ca