#2671 ⟨a, b | abaab=aaaba⟩
Quick links
- Properties
- Rewriting system
- Presentation has sum-of-sides 10
- Infinite non-cancellative non-commutative monoid
- Not left cancellative, because left multiplication by a is not injective:
-
a ⋅ ba2b = a3ba and a ⋅ a2ba = a3ba, however ba2b ≠ a2ba
- Enveloping group: ⟨a, b | aabab-1b-1⟩
- Auxiliary generators:
- c = aa
- d = bc
- e = cba
- Reduction order:
- Left-to-right shortlex with a < d < e < b < c
- Certificate: derivations of all rewriting rules from the defining relations.
- Morphocompletion: how the auxiliary generators were found.
# ab:abaab=aaaba adebc aa=c,bc=d,cba=e morph:2/0,2/1,3/0
aa=c
bc=d
ca=ac
cd=ea
adb=ae
aec=add
abe=aea
ddb=de
dec=ddd
dba=be
dbe=dea
eab=ce
edb=ee
eec=edd
ebe=eea
bac=da
bea=dd
bec=dda
cec=ead
cba=e
cbe=cea
adea=aee
aeac=adda
aeea=addd
aeeb=adce
daba=bae
ddea=dee
deac=ddda
deea=dddd
deeb=ddce
eaea=cee
edea=eee
eeac=edda
eeea=eddd
eeeb=edce
badd=dada
baea=dad
beea=ddad
ceac=eada
ceea=eadd
ceeb=eace
addad=acee
addda=aedd
aedda=adddc
aeddd=adcee
dadab=bade
ddada=bedd
dddad=dcee
dddda=dedd
dedda=ddddc
deddd=ddcee
eadad=ccee
eadda=cedd
eddad=ecee
eddda=eedd
eedda=edddc
eeddd=edcee
bedda=ddadc
cedda=eaddc
ceddd=eacee
aeedad=adccee
dadada=baedd
dadaea=badee
deedad=ddccee
eeedad=edccee
ceedad=eaccee
adceeda=aededd
dadadda=badedd
ddceeda=dededd
eaceeda=cededd
edceeda=eededd
addaeeda=acededd
aeddeeda=adcededd
dddaeeda=dcededd
deddeeda=ddcededd
eadaeeda=ccededd
eddaeeda=ecededd
eeddeeda=edcededd
ceddeeda=eacededd
aeedaeeda=adccededd
dadaceeda=badededd
deedaeeda=ddccededd
eeedaeeda=edccededd
ceedaeeda=eaccededd