#6213 ⟨
a
,
b
,
c
|
aa
=1,
babbcc
=1⟩
Up:
Monoid enumeration
Prev:
#6211
⟨
a
,
b
,
c
|
aa
=1,
babbbc
=1⟩
Next:
#6215
⟨
a
,
b
,
c
|
aa
=1,
babcac
=1⟩
Contents
Properties
Rewriting system
Properties
Sum of relation sides is 8
Infinite non-cancellative non-commutative monoid
Element
ba
has infinite order
Not left cancellative, because left multiplication by
b
is not injective:
b
⋅
a
b
2
c
2
b
=
b
and
b
⋅ 1 =
b
, however
a
b
2
c
2
b
≠ 1
Not right cancellative, because right multiplication by
a
b
2
c
2
is not injective:
a
b
2
c
2
b
⋅
a
b
2
c
2
=
a
b
2
c
2
and 1 ⋅
a
b
2
c
2
=
a
b
2
c
2
, however
a
b
2
c
2
b
≠ 1
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.
a
2
⇒ 1
[1]
2.
ba
b
2
c
2
⇒ 1
[2]
# abc:aa=1,babbcc=1 abc - - aa=1 babbcc=1