#1489 ⟨
a
,
b
|
abaaabbbab
=1⟩
Up:
Monoid enumeration
Prev:
#1481
⟨
a
,
b
|
abaaaabbab
=1⟩
Next:
#1496
⟨
a
,
b
|
abaababbab
=1⟩
Contents
Properties
Rewriting system
Properties
Sum of relation sides is 10
Infinite non-cancellative non-commutative monoid
Element
a
has infinite order
Not left cancellative, because left multiplication by
a
is not injective:
a
⋅
b
a
3
b
3
aba
=
a
and
a
⋅ 1 =
a
, however
b
a
3
b
3
aba
≠ 1
Not right cancellative, because right multiplication by
b
is not injective:
ab
a
3
b
2
⋅
b
=
a
3
b
3
ab
and
a
3
b
3
a
⋅
b
=
a
3
b
3
ab
, however
ab
a
3
b
2
≠
a
3
b
3
a
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
Certificate
: derivations of all rewriting rules from the defining relations.
#
Rule
Proof
1.
ab
a
3
b
3
⇒
a
3
b
3
ab
[2]
2.
a
3
b
3
(
ab
)
2
⇒ 1
[3]
# ab:abaaabbbab=1 ab - - abaaabbb=aaabbbab aaabbbabab=1