#4741 ⟨
a
,
b
,
c
|
aa
=
b
,
bbccc
=1⟩
Up:
Monoid enumeration
Prev:
#4737
⟨
a
,
b
,
c
|
aa
=
b
,
bbcac
=1⟩
Next:
#4771
⟨
a
,
b
,
c
|
aa
=
b
,
ccccc
=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
⋅
a
3
c
3
a
=
a
and
a
⋅ 1 =
a
, however
a
3
c
3
a
≠ 1
Not right cancellative, because right multiplication by
a
3
c
3
is not injective:
a
3
c
3
a
⋅
a
3
c
3
=
a
3
c
3
and 1 ⋅
a
3
c
3
=
a
3
c
3
, however
a
3
c
3
a
≠ 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(
a
) = deg(
c
) = 0,
a
<
c
; deg(
b
) = 1
Certificate
: derivations of all rewriting rules from the defining relations.
#
Rule
Proof
1.
a
4
c
3
⇒ 1
[2]
2.
b
⇒
a
2
[1]
# abc:aa=b,bbccc=1 ac/b - - aaaaccc=1 b=aa