#1401 ⟨
a
,
b
|
aabaaabbab
=1⟩
Up:
Monoid enumeration
Prev:
#1399
⟨
a
,
b
|
aabaaababb
=1⟩
Next:
#1405
⟨
a
,
b
|
aabaabaabb
=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
⋅
ab
a
3
b
(
ba
)
2
=
a
and
a
⋅ 1 =
a
, however
ab
a
3
b
(
ba
)
2
≠ 1
Not right cancellative, because right multiplication by
ab
a
3
b
2
ab
is not injective:
ab
a
3
b
(
ba
)
2
⋅
ab
a
3
b
2
ab
=
ab
a
3
b
2
ab
and 1 ⋅
ab
a
3
b
2
ab
=
ab
a
3
b
2
ab
, however
ab
a
3
b
(
ba
)
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 shortlex with
a
<
b
Certificate
: derivations of all rewriting rules from the defining relations.
#
Rule
Proof
1.
a
2
b
a
3
b
2
ab
⇒ 1
[1]
# ab:aabaaabbab=1 ab - - aabaaabbab=1