#21749 ⟨a, b | aaa=1, abbbbba=b⟩
Contents
- Properties
- Rewriting system
- Sum of relation sides is 11
- Infinite non-cancellative non-commutative monoid
- Element bab has infinite order
- Not left cancellative, because left multiplication by d is not injective:
-
d ⋅ dcb = d and d ⋅ 1 = d, however dcb ≠ 1
- Not right cancellative, because right multiplication by b is not injective:
-
dcb ⋅ b = b and 1 ⋅ b = b, however dcb ≠ 1
- Auxiliary generators:
- c = bbb
- d = acbacba
- Reduction order:
- Left-to-right recursive path with deg(c) = deg(b) = 0, c < b; deg(d) = 1; deg(a) = 2
- Certificate: derivations of all rewriting rules from the defining relations.
- Morphocompletion: how the auxiliary generators were found.
# ab:aaa=1,abbbbba=b cb/d/a bbb=c,acbacba=d morph:3/0,7/0
bc=cb
bbb=c
dcc=bb
dcbb=b
cd=dc
bd=db
ddcb=d
cadcb=ca
badcb=ba
cca=acc
ccba=bacc
ccbba=bbacc
da=bbaddbb
dca=cbbaddbb
dba=caddbb
dcba=adcb
dbba=cbaddbb
aac=cbbabb
aab=cbba
aad=cbbaddc
acba=baddc
acbba=b
caa=bbacbb
baa=acbb
baba=acacccbb
bbaca=cabadddb
aaa=1
acaca=babbadddddc