#1751 ⟨
a
,
b
,
c
|
aab
=
cb
,
acc
=1⟩
Up:
Monoid enumeration
Prev:
#1750
⟨
a
,
b
,
c
|
aab
=
cb
,
acb
=1⟩
Next:
#1760
⟨
a
,
b
,
c
|
aab
=
cb
,
bcc
=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
⋅
c
2
a
=
a
and
a
⋅ 1 =
a
, however
c
2
a
≠ 1
Not right cancellative, because right multiplication by
b
is not injective:
a
2
⋅
b
=
cb
and
c
⋅
b
=
cb
, however
a
2
≠
c
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.
a
2
b
⇒
cb
[1]
2.
a
c
2
⇒ 1
[2]
# abc:aab=cb,acc=1 abc - - aab=cb acc=1