#11723 ⟨
a
,
b
|
aaab
=
aa
,
bbbbb
=1⟩
Up:
Monoid enumeration
Prev:
#11639
⟨
a
,
b
|
aaaa
=
aa
,
bbbbb
=1⟩
Next:
#11787
⟨
a
,
b
|
aaab
=
ba
,
bbbbb
=1⟩
Contents
Properties
Rewriting system
Properties
Sum of relation sides is 11
Infinite non-cancellative non-commutative monoid
Element
ba
has infinite order
Not left cancellative, because left multiplication by
a
is not injective:
a
⋅
a
6
=
a
2
and
a
⋅
a
=
a
2
, however
a
6
≠
a
Not right cancellative, because right multiplication by
a
is not injective:
a
6
⋅
a
=
a
2
and
a
⋅
a
=
a
2
, however
a
6
≠
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 recursive path with deg(
a
) = 0; deg(
b
) = 1
Certificate
: derivations of all rewriting rules from the defining relations.
#
Rule
Proof
1.
a
7
⇒
a
2
[7]
2.
a
2
b
⇒
a
6
[6]
3.
b
5
⇒ 1
[2]
# ab:aaab=aa,bbbbb=1 a/b - - aaaaaaa=aa aab=aaaaaa bbbbb=1