#482 ⟨
a
,
b
,
c
|
bb
=
aa
,
abc
=1⟩
Up:
Monoid enumeration
Prev:
#481
⟨
a
,
b
,
c
|
bb
=
aa
,
aac
=1⟩
Next:
#485
⟨
a
,
b
,
c
|
bb
=
aa
,
acc
=1⟩
Contents
Properties
Rewriting system
Properties
Sum of relation sides is 7
Infinite non-cancellative non-commutative monoid
Element
b
has infinite order
Not left cancellative, because left multiplication by
b
is not injective:
b
⋅
b
2
(
cb
)
2
=
b
and
b
⋅ 1 =
b
, however
b
2
(
cb
)
2
≠ 1
Not right cancellative, because right multiplication by
b
(
bc
)
2
is not injective:
b
2
(
cb
)
2
⋅
b
(
bc
)
2
=
b
(
bc
)
2
and 1 ⋅
b
(
bc
)
2
=
b
(
bc
)
2
, however
b
2
(
cb
)
2
≠ 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(
c
) = deg(
b
) = 0,
c
<
b
; deg(
a
) = 1
Certificate
: derivations of all rewriting rules from the defining relations.
#
Rule
Proof
1.
b
3
cbc
⇒ 1
[6]
2.
b
5
c
⇒
b
3
c
b
2
[7]
3.
(
b
3
c
)
2
⇒
b
2
[5]
4.
a
⇒
b
3
c
[4]
# abc:bb=aa,abc=1 cb/a - - bbbcbc=1 bbbbbc=bbbcbb bbbcbbbc=bb a=bbbc