#2595 ⟨a, b | ababab=abba⟩
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 ⋅ b(ab)2 = ab2a and a ⋅ b2a = ab2a, however b(ab)2 ≠ b2a
- Enveloping group: ⟨a, b | aaba-1b-1⟩
- Auxiliary generators:
- c = abba
- d = ba
- Reduction order:
- Left-to-right recursive path with deg(b) = deg(c) = 0, b < c; deg(d) = 1; deg(a) = 2
- Certificate: derivations of all rewriting rules from the defining relations.
- Morphocompletion: how the auxiliary generators were found.
# ab:ababab=abba bc/d/a abba=c,ba=d morph:4/0,2/2
cccb=cbc
cbccb=cbbc
dbccb=dbbc
cdccb=cdbc
cdcbbccb=cdcbbbc
cbdccb=cbdbc
ccd=cdc
bcbd=dbbc
cbcd=cbdc
ccbdcbbccb=ccbdcbbbc
bccbd=dbcbc
cbbcd=cdbcbc
ddbc=bcd
ddbbc=bcdcb
dbd=bc
dbcd=bcc
dbbcd=bcdbc
cddb=cbd
cddcb=ccbd
cddccb=cbdc
cdcd=cddc
cdcbd=ccbc
cdcbbd=ccbdcb
cdcbbbcd=ccbcbcbc
bcdd=dbcc
cbdd=cdbc
cbdcd=cdbcc
cbdcbd=cbcbc
ccbdcbbd=cdcbbbc
ccbdcbbbcd=ccbcbcbcbc
dddb=bc
cddd=ccc
cddcd=cccc
abbc=cbd
abcc=cdd
abcbc=ccbd
abcbbc=ccbdcb
adbc=cd
adbbc=cdcb
abd=c
abcd=cc
addb=c
ba=d
ca=addd
cda=addddd
cbda=ccc
cdda=addddddd