#2287 ⟨a, b | aabbbba=baa⟩
Quick links
- Properties
- Rewriting system
- Presentation has sum-of-sides 10
- Infinite non-cancellative non-commutative monoid
- Not right cancellative, because right multiplication by a is not injective:
-
a2b4 ⋅ a = ba2 and ba ⋅ a = ba2, however a2b4 ≠ ba
- Enveloping group: ⟨a, b | aaaabba-1b-1⟩
- Auxiliary generators:
- c = bbbba
- d = cccc
- e = da
- Reduction order:
- Right-to-left recursive path with deg(a) = 0; deg(e) = 1; deg(d) = deg(c) = deg(b) = 2, d < c < b
- Certificate: derivations of all rewriting rules from the defining relations.
- Morphocompletion: how the auxiliary generators were found.
# ab:aabbbba=baa reversed:a/e/dcb bbbba=c,cccc=d,da=e morph:5/2,4/0,2/0
aaeeee=ea
aaeeed=e
da=e
de=eaeeed
ca=aad
ce=ead
baa=aac
bea=aaeaeaeeeeaeeeeaeeed
baea=aaaaeaeeeeaeeeeaeeeeaeeed
bee=aaeaeaeeeeaeeeeaeeeeeeed
baee=aaaaeaeeeeaeeeeaeeeeaeeeeeeed
aaeaeaeeeeaeeedd=be
aaaaeaeeeeaeeeeaeeedd=bae
aaeeecd=ec
dc=cd
dbe=eaeaeaeeeeaeeedd
dbae=eaaaeaeeeeaeeeeaeeedd
cbe=aaeeaeaeeeeaeeedd
cbae=aaeaaeaeeeeaeeeeaeeedd
bbe=aaeaeeaeeeeaeeedd
babe=aaaaeaeeeeeaeeeeaeeedd
bebe=aaeaeaeeeeaeeeeaeeeeeaeaeeeeaeeedd
baebe=aaaaeaeeeeaeeeeaeeeeaeeeeeaeaeeeeaeeedd
bbae=aaaaeeaeeeeaeeeeaeeedd
babae=aaaaeaeaeeeeaeeeeaeeedd
bebae=aaeaeaeeeeaeeeeaeeeeaaeaeeeeaeeeeaeeedd
baebae=aaaaeaeeeeaeeeeaeeeeaeeeeaaeaeeeeaeeeeaeeedd
aaeaeaeeeeaeeecdd=bec
aaaaeaeeeeaeeeeaeeecdd=baec
aaeeeccd=ecc
aaeaeaeeeeaeeeccdd=becc
aaaaeaeeeeaeeeeaeeeccdd=baecc
aaeeecccd=eccc
cccc=d
bbbba=c
aaeaeaeeeeaeeecccdd=beccc
aaaaeaeeeeaeeeeaeeecccdd=baeccc