#4871 ⟨
a
,
b
,
c
|
ab
=
a
,
bbcbc
=1⟩
Up:
Monoid enumeration
Prev:
#4865
⟨
a
,
b
,
c
|
ab
=
a
,
bbbcc
=1⟩
Next:
#4873
⟨
a
,
b
,
c
|
ab
=
a
,
bbccb
=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
⋅
b
=
a
and
a
⋅ 1 =
a
, however
b
≠ 1
Not right cancellative, because right multiplication by (
bc
)
2
is not injective:
b
(
cb
)
2
⋅ (
bc
)
2
= (
bc
)
2
and 1 ⋅ (
bc
)
2
= (
bc
)
2
, however
b
(
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 shortlex with
a
<
b
<
c
Certificate
: derivations of all rewriting rules from the defining relations.
#
Rule
Proof
1.
ab
⇒
a
[1]
2.
acbc
⇒
a
[3]
3.
b
(
bc
)
2
⇒ 1
[2]
# abc:ab=a,bbcbc=1 abc - - ab=a acbc=a bbcbc=1