#356 ⟨
a
,
b
,
c
|
aba
=
b
,
abc
=1⟩
Up:
Monoid enumeration
Prev:
#355
⟨
a
,
b
,
c
|
aba
=
a
,
ccc
=1⟩
Next:
#357
⟨
a
,
b
,
c
|
aba
=
b
,
aca
=1⟩
Contents
Properties
Rewriting system
Properties
Sum of relation sides is 7
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.
aba
⇒
b
[1]
2.
abc
⇒ 1
[2]
3.
b
2
a
⇒
a
b
2
[3]
4.
b
2
c
⇒
ab
[4]
# abc:aba=b,abc=1 abc - - aba=b abc=1 bba=abb bbc=ab