#11287 ⟨
a
,
b
|
aaabb
=
b
,
ababb
=1⟩
Up:
Monoid enumeration
Prev:
#11281
⟨
a
,
b
|
aaabb
=
b
,
aabab
=1⟩
Next:
#11325
⟨
a
,
b
|
aabaa
=
a
,
bbbbb
=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
⋅
ba
b
2
a
=
a
and
a
⋅ 1 =
a
, however
ba
b
2
a
≠ 1
Not right cancellative, because right multiplication by
b
is not injective:
a
3
b
⋅
b
=
b
and 1 ⋅
b
=
b
, however
a
3
b
≠ 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
3
b
2
⇒
b
[1]
2.
aba
b
2
⇒ 1
[2]
# ab:aaabb=b,ababb=1 ab - - aaabb=b ababb=1