#1976 ⟨
a
,
b
,
c
|
abc
=
ba
,
bcc
=1⟩
Up:
Monoid enumeration
Prev:
#1974
⟨
a
,
b
,
c
|
abc
=
ba
,
bca
=1⟩
Next:
#1977
⟨
a
,
b
,
c
|
abc
=
ba
,
caa
=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
b
is not injective:
b
⋅
c
2
b
=
b
and
b
⋅ 1 =
b
, however
c
2
b
≠ 1
Not right cancellative, because right multiplication by
c
2
is not injective:
c
2
b
⋅
c
2
=
c
2
and 1 ⋅
c
2
=
c
2
, however
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 recursive path with deg(
b
) = deg(
c
) = 0,
b
<
c
; deg(
a
) = 1
Certificate
: derivations of all rewriting rules from the defining relations.
#
Rule
Proof
1.
b
c
2
⇒ 1
[2]
2.
ba
⇒
abc
[1]
# abc:abc=ba,bcc=1 bc/a - - bcc=1 ba=abc