#2210 ⟨a, b | ba=ab, aaab=a⟩
Quick links
- Properties
- Staircase diagram
- Rewriting system
- Isomorphic instances
- Presentation has sum-of-sides 9
- Infinite non-cancellative commutative monoid
- Not cancellative, because multiplication by ab is not injective:
-
ab ⋅ a2b = ab and ab ⋅ 1 = ab, however a2b ≠ 1
- Commutative Gröbner basis: ⟨a, b | a3b=a⟩
- Cancellative quotient is isomorphic to ℤ
- Enveloping group is isomorphic to ℤ
- 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:ba=ab,aaab=a ab
ba=ab
aaab=a
The mapping is from the listed presentation's alphabet to the current rewriting system's alphabet.
5 total
| Σ | # | Presentation | Mapping |
|---|
| 9 | 2212 | ⟨a, b | ba=ab, aaba=a⟩ | φ(a) = a, φ(b) = b |
| 10 | 4661 | ⟨a, b | aaab=a, baaa=a⟩ | φ(a) = a, φ(b) = b |
| 11 | 12948 | ⟨a, b | aba=aab, baaa=a⟩ | φ(a) = a, φ(b) = b |
| 11 | 13046 | ⟨a, b | baa=aab, aaab=a⟩ | φ(a) = a, φ(b) = b |
| 11 | 13048 | ⟨a, b | baa=aab, aaba=a⟩ | φ(a) = a, φ(b) = b |