#13291 ⟨
a
,
b
|
aaaaa
=1,
ababab
=1⟩
Up:
Monoid enumeration
Prev:
#13281
⟨
a
,
b
|
aaaaa
=1,
aabaab
=1⟩
Next:
#13293
⟨
a
,
b
|
aaaaa
=1,
ababbb
=1⟩
Contents
Properties
Rewriting system
Properties
Sum of relation sides is 11
Infinite non-Abelian group
Element
a
2
b
a
2
has infinite order
Inverses of generators:
a
-1
=
a
4
b
-1
=
a
(
ba
)
2
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
5
⇒ 1
[1]
2.
b
(
ab
)
2
⇒
a
4
[3]
# ab:aaaaa=1,ababab=1 ab - - aaaaa=1 babab=aaaa