#22 ⟨
a
,
b
|
ba
=
ab
⟩
Up:
Monoid enumeration
Prev:
#21
⟨
a
,
b
|
ab
=
aa
⟩
Next:
#23
⟨
a
,
b
|
bb
=
aa
⟩
Contents
Properties
Commutative structure
Staircase diagram
Rewriting system
Properties
Sum of relation sides is 4
Isomorphic to ℕ ⊕ ℕ
Infinite cancellative commutative monoid
Element
a
has infinite order
Commutative structure
Gröbner basis: ⟨
a
,
b
| ⟩
Enveloping group is isomorphic to ℤ ⊕ ℤ
Group of units is isomorphic to ℤ
1
4 Archimedian components:
1,
a
,
b
,
ab
Staircase diagram
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.
ba
⇒
ab
[1]
# ab:ba=ab ab - - ba=ab
