#2249 ⟨a, b | aababba=baa⟩
Quick links
- Properties
- Rewriting system
- Presentation has sum-of-sides 10
- Infinite non-cancellative non-commutative monoid
- Not right cancellative, because right multiplication by a is not injective:
-
a2bab2 ⋅ a = ba2 and ba ⋅ a = ba2, however a2bab2 ≠ ba
- Enveloping group: ⟨a, b | aababba-1b-1⟩
- Auxiliary generators:
- c = aababb
- d = bc
- e = babb
- Reduction order:
- Right-to-left recursive path with deg(a) = deg(c) = deg(d) = 0, a < c < d; deg(e) = 1; deg(b) = 2
- Certificate: derivations of all rewriting rules from the defining relations.
- Morphocompletion: how the auxiliary generators were found.
# ab:aababba=baa reversed:acd/e/b aababb=c,bc=d,babb=e morph:6/0,2/0,4/0
aacda=caa
cacda=daa
aacdc=cac
cacdc=dac
aacdd=cad
cacdd=dad
aae=c
cae=d
ec=cdae
aacded=dd
cacded=daed
eaa=cda
eac=cdc
edc=cdacdcdae
ead=cdd
edd=cdacded
edaa=cdacdcda
edac=cdacdcdc
edad=cdacdcdd
cdaeae=ed
aacdeed=ded
cacdeed=daeed
eaed=cded
eded=cdacdeed
edaed=cdacdcded
cdaedaeae=eed
eeed=cdacdacdcdedaeae
eaeed=cdeed
edeed=cdacdcdacdacdcdedaeae
edaeed=cdacdcdeed
bc=d
bd=dae
baa=ca
bac=cc
bad=cd
bed=ddaeae
baed=ced
beed=ddaedaeae
baeed=ceed
babe=eabb
babb=e