#995 ⟨a, b | abbaaab=ba⟩
Properties
- Presentation has sum-of-sides 9
- Infinite non-commutative monoid
Complete rewriting system
- Reduction order:
- Right-to-left recursive path with deg(c) = deg(d) = 0, c < d; deg(a) = 1; deg(b) = 2
- Auxiliary generator: aab=c
- Auxiliary generator: bbac=d
- ad2c ⇒ d
- ca(dc)2 ⇒ ad
- da(dc)3 ⇒ ad3
- c2adc(cd)2c2 ⇒ acd
- a2d ⇒ cadc
- ad2ad ⇒ da(dc)2
- acadc ⇒ ca
- ad2acd ⇒ dcadc(cd)2c2
- acad2 ⇒ c2adc2(dc)2
- adad3 ⇒ dad(cdc)2dc
- ada(dc)2 ⇒ cadcdad
- acda(dc)2 ⇒ c2adc2(dc)2ad
- ad3a(dc)2 ⇒ dad(cd)2ad
- ac2adcd2 ⇒ c2a(dc2)2(dc)2
- (adc)2(cd)2c2 ⇒ cadcdacd
- acdadc(cd)2c2 ⇒ c2adc(cd)2acd
- acdcadc(cd)2c2 ⇒ c2adc2(dc)2acd
- ad3cadc(cd)2c2 ⇒ dad(cd)2acd
- ac(ad)2 ⇒ c2adc2dc
- ac2adcdad ⇒ c2ad(c2d)2c
- acadacd ⇒ c2a(cd)2c2
- ac2adcdacd ⇒ c2adc3dcdc2
- ac(cad)2d2 ⇒ c2a(dc2)3(dc)2
- a2b ⇒ c
- bc ⇒ adab
- bd ⇒ ad3c
- ba ⇒ ad
# ab:abbaaab=ba reversed:cd/a/b aab=c,bbac=d frequency:3/0,4/3
addc=d
cadcdc=ad
dadcdcdc=addd
ccadccdcdcc=acd
aad=cadc
addad=dadcdc
acadc=ca
addacd=dcadccdcdcc
acadd=ccadccdcdc
adaddd=dadcdccdcdc
adadcdc=cadcdad
acdadcdc=ccadccdcdcad
adddadcdc=dadcdcdad
accadcdd=ccadccdccdcdc
adcadccdcdcc=cadcdacd
acdadccdcdcc=ccadccdcdacd
acdcadccdcdcc=ccadccdcdcacd
adddcadccdcdcc=dadcdcdacd
acadad=ccadccdc
accadcdad=ccadccdccdc
acadacd=ccacdcdcc
accadcdacd=ccadcccdcdcc
accadcaddd=ccadccdccdccdcdc
aab=c
bc=adab
bd=adddc
ba=ad
Right Cayley graph (truncated)
Left Cayley graph (truncated)