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