#2724 ⟨
a
,
b
,
c
|
abc
=
a
,
bcbc
=1⟩
Up:
Monoid enumeration
Prev:
#2721
⟨
a
,
b
,
c
|
abc
=
a
,
bcac
=1⟩
Next:
#2726
⟨
a
,
b
,
c
|
abc
=
a
,
bccb
=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
⋅
bc
=
a
and
a
⋅ 1 =
a
, however
bc
≠ 1
Not right cancellative, because right multiplication by
cbc
is not injective:
(
cb
)
2
⋅
cbc
=
cbc
and 1 ⋅
cbc
=
cbc
, however (
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.
abc
⇒
a
[1]
2.
(
bc
)
2
⇒ 1
[2]
# abc:abc=a,bcbc=1 abc - - abc=a bcbc=1