#21057 ⟨a, b | ba=ab, aaab=abb⟩
Quick links
- Properties
- Staircase diagram
- Rewriting system
- Isomorphic instances
- Presentation has sum-of-sides 11
- Infinite non-cancellative commutative monoid
- Not cancellative, because multiplication by ab is not injective:
-
ab ⋅ a2 = a3b and ab ⋅ b = a3b, however a2 ≠ b
- Commutative Gröbner basis: ⟨a, b | ab2=a3b⟩
- Cancellative quotient is isomorphic to ℕ
- Enveloping group is isomorphic to ℤ
- Group of units is isomorphic to ℤ1
- 4 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=abb ab
ba=ab
aaab=abb
The mapping is from the listed presentation's alphabet to the current rewriting system's alphabet.
5 total
| Σ | # | Presentation | Mapping |
|---|
| 11 | 21059 | ⟨a, b | ba=ab, aaab=bab⟩ | φ(a) = a, φ(b) = b |
| 11 | 21060 | ⟨a, b | ba=ab, aaab=bba⟩ | φ(a) = a, φ(b) = b |
| 11 | 21065 | ⟨a, b | ba=ab, aaba=abb⟩ | φ(a) = a, φ(b) = b |
| 11 | 21067 | ⟨a, b | ba=ab, aaba=bab⟩ | φ(a) = a, φ(b) = b |
| 11 | 21068 | ⟨a, b | ba=ab, aaba=bba⟩ | φ(a) = a, φ(b) = b |