#1916 ⟨
a
,
b
,
c
|
abc
=
aa
,
bbb
=1⟩
Up:
Monoid enumeration
Prev:
#1914
⟨
a
,
b
,
c
|
abc
=
aa
,
bac
=1⟩
Next:
#1917
⟨
a
,
b
,
c
|
abc
=
aa
,
bbc
=1⟩
Contents
Properties
Rewriting system
Properties
Sum of relation sides is 8
Infinite non-cancellative non-commutative monoid
Element
a
has infinite order
Not left cancellative, because left multiplication by
a
is not injective:
a
⋅
bc
=
a
2
and
a
⋅
a
=
a
2
, however
bc
≠
a
Rewriting system
Format:
Pretty
Plain
Word:
Enter a word above to compute its normal form. Tips:
Lowercase letters stand for generators.
Spaces are ignored.
Numbers repeat the previous letter, e.g.
b90
.
Strategy:
Leftmost
Rightmost
Result:
1
1
Reduction order:
Left-to-right shortlex with
a
<
b
<
c
Certificate
: derivations of all rewriting rules from the defining relations.
#
Rule
Proof
1.
abc
⇒
a
2
[1]
2.
b
3
⇒ 1
[2]
# abc:abc=aa,bbb=1 abc - - abc=aa bbb=1