#1087 ⟨
a
,
b
,
c
|
aa
=1,
abccc
=1⟩
Up:
Monoid enumeration
Prev:
#1086
⟨
a
,
b
,
c
|
aa
=1,
abccb
=1⟩
Next:
#1092
⟨
a
,
b
,
c
|
aa
=1,
babac
=1⟩
Contents
Properties
Rewriting system
Properties
Sum of relation sides is 7
Infinite non-cancellative non-commutative monoid
Element
b
has infinite order
Not left cancellative, because left multiplication by
b
is not injective:
b
⋅ (
c
3
b
)
2
=
b
and
b
⋅ 1 =
b
, however (
c
3
b
)
2
≠ 1
Not right cancellative, because right multiplication by
c
3
b
c
3
is not injective:
(
c
3
b
)
2
⋅
c
3
b
c
3
=
c
3
b
c
3
and 1 ⋅
c
3
b
c
3
=
c
3
b
c
3
, however (
c
3
b
)
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 recursive path with deg(
b
) = deg(
c
) = 0,
b
<
c
; deg(
a
) = 1
Certificate
: derivations of all rewriting rules from the defining relations.
#
Rule
Proof
1.
(
b
c
3
)
2
⇒ 1
[4]
2.
a
⇒
b
c
3
[3]
# abc:aa=1,abccc=1 bc/a - - bcccbccc=1 a=bccc