#4973 ⟨
a
,
b
|
aaaabab
=
baba
⟩
Up:
Monoid enumeration
Prev:
#4972
⟨
a
,
b
|
aaaabab
=
baab
⟩
Next:
#4974
⟨
a
,
b
|
aaaabab
=
babb
⟩
Contents
Properties
Rewriting system
Other submonoids of same group
Properties
Sum of relation sides is 11
Infinite cancellative non-commutative monoid
Element
a
has infinite order
Submonoid of enveloping group: ⟨
a
,
b
|
aaaabba
-1
b
-1
b
-1
⟩
Embedding:
φ
(
a
) =
a
,
φ
(
b
) =
a
-1
b
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
4
bab
⇒ (
ba
)
2
[1]
# ab:aaaabab=baba ab - - aaaabab=baba
Other submonoids of same group
1 unique, 1 total
Σ
#
Presentation
Properties
9
1031
⟨
a
,
b
|
aaaabb
=
bba
⟩
Can
Inf