#566 ⟨a, b | aaa=a, aba=b⟩
Contents
- Properties
- Commutative structure
- Staircase diagram
- Rewriting system
- Isomorphic instances
- Sum of relation sides is 8
- Infinite non-cancellative commutative monoid
- Element b has infinite order
- Not cancellative, because multiplication by a is not injective:
-
a ⋅ a2 = a and a ⋅ 1 = a, however a2 ≠ 1
- Gröbner basis: ⟨a, b | a3=a, a2b=b⟩
- Cancellative quotient is isomorphic to ℤ2 ⊕ ℕ
- Enveloping group is isomorphic to ℤ2 ⊕ ℤ
- Group of units is isomorphic to ℤ1
- 3 Archimedian components:
- Reduction order:
- Left-to-right shortlex with a < b
- Certificate: derivations of all rewriting rules from the defining relations.
# ab:aaa=a,aba=b ab - -
ba=ab
aaa=a
aab=b
The mapping is from the listed presentation's alphabet to the current rewriting system's alphabet.
1 total
| Σ | # | Presentation | Mapping |
| 10 | 6243 | ⟨a, b | aaa=a, aaaba=b⟩ | φ(a) = a, φ(b) = b |