#4557 ⟨
a
,
b
,
c
|
abc
=1,
baba
=
b
⟩
Up:
Monoid enumeration
Prev:
#4553
⟨
a
,
b
,
c
|
abc
=1,
baab
=
a
⟩
Next:
#4559
⟨
a
,
b
,
c
|
abc
=1,
babb
=
a
⟩
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
⋅
bca
=
a
and
a
⋅ 1 =
a
, however
bca
≠ 1
Not right cancellative, because right multiplication by
bc
is not injective:
bca
⋅
bc
=
bc
and 1 ⋅
bc
=
bc
, however
bca
≠ 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
⇒ 1
[1]
2.
b
2
a
⇒
bab
[4]
3.
b
2
c
⇒
bab
[3]
4.
(
ba
)
2
⇒
b
[2]
# abc:abc=1,baba=b abc - - abc=1 bba=bab bbc=bab baba=b