#17655 ⟨a, b | aaaa=1, ababb=ba⟩
Contents
- Properties
- Rewriting system
- Sum of relation sides is 11
- Infinite non-cancellative non-commutative monoid
- Element c has infinite order
- Not left cancellative, because left multiplication by e is not injective:
-
e ⋅ d2 = e and e ⋅ 1 = e, however d2 ≠ 1
- Not right cancellative, because right multiplication by e is not injective:
-
d2 ⋅ e = e and 1 ⋅ e = e, however d2 ≠ 1
- Auxiliary generators:
- c = abb
- d = bbbb
- e = daa
- Reduction order:
- Left-to-right recursive path with deg(e) = deg(d) = 0, e < d; deg(c) = 1; deg(a) = deg(b) = 2, a < b
- Certificate: derivations of all rewriting rules from the defining relations.
# ab:aaaa=1,ababb=ba ed/c/ab abb=c,bbbb=d,daa=e custom:0
ede=d
edd=e
dde=e
ddd=d
cdd=c
ddc=c
dcdec=cdeced
eecdc=dcdcde
decdc=ecdcde
dccec=eccecd
dcecc=ececcd
dcecdc=cdececde
eeccdec=dcdcced
deccec=ccecd
deccdec=ecdcced
dececc=ceccd
eccecdc=ceccdece
ececcec=cceccded
dcccec=cdecedcecd
eecececc=dcdcdeeccd
decececc=ecdcdeeccd
cceccdec=d
dcecececc=cdececdeeccd
eeccccec=dcdccedcecd
eecccecc=dcdccdccd
deccccec=ecdccedcecd
decccecc=ecdccdccd
eccccecc=ceccdecececde
eccecececc=ceccdeceeccd
dccccecc=eccecccecde
cceccccec=dcecd
ccecccecc=deccd
dcccccecc=cdeceececcdcecde
eeccccccecc=dcdcceececcdcecde
deccccccecc=ecdcceececcdcecde
cceccccccecc=ececcdcecde
ea=aecdccdcce
da=aecdccdccd
ca=accecc
bdd=b
eb=bcdececdecec
db=bd
cb=bcec
aae=dee
aad=ded
aac=dec
ba=abc
bb=adec
aab=bccceccde
aaaa=1