#7865 ⟨
a
,
b
,
c
|
ab
=1,
ccc
=
aca
⟩
Up:
Monoid enumeration
Prev:
#7862
⟨
a
,
b
,
c
|
ab
=1,
ccc
=
aac
⟩
Next:
#7866
⟨
a
,
b
,
c
|
ab
=1,
ccc
=
acb
⟩
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
⋅
ba
=
a
and
a
⋅ 1 =
a
, however
ba
≠ 1
Not right cancellative, because right multiplication by
b
is not injective:
ba
⋅
b
=
b
and 1 ⋅
b
=
b
, however
ba
≠ 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 recursive path with deg(
c
) = 0; deg(
a
) = deg(
b
) = 1,
a
<
b
Certificate
: derivations of all rewriting rules from the defining relations.
#
Rule
Proof
1.
c
4
a
⇒
a
c
4
[4]
2.
c
3
b
⇒
ac
[3]
3.
aca
⇒
c
3
[2]
4.
ab
⇒ 1
[1]
# abc:ab=1,ccc=aca c/ab - - cccca=acccc cccb=ac aca=ccc ab=1