#3191 ⟨
a
,
b
|
abaaababbab
=1⟩
Up:
Monoid enumeration
Prev:
#3183
⟨
a
,
b
|
abaaaabbbab
=1⟩
Next:
#3195
⟨
a
,
b
|
abaaabbabab
=1⟩
Contents
Properties
Rewriting system
Properties
Sum of relation sides is 11
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
(
bab
)
2
a
=
a
and
a
⋅ 1 =
a
, however
b
a
3
(
bab
)
2
a
≠ 1
Not right cancellative, because right multiplication by
b
is not injective:
ab
a
3
bab
⋅
b
=
a
3
(
bab
)
2
and
a
3
ba
b
2
a
⋅
b
=
a
3
(
bab
)
2
, however
ab
a
3
bab
≠
a
3
ba
b
2
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
ba
b
2
⇒
a
3
(
bab
)
2
[2]
2.
a
3
(
bab
)
2
ab
⇒ 1
[3]
# ab:abaaababbab=1 ab - - abaaababb=aaababbab aaababbabab=1