#7021 ⟨a, b | ba=ab, aaabb=b⟩
Quick links
- Properties
- Staircase diagram
- Rewriting system
- Isomorphic instances
- Presentation has sum-of-sides 10
- Infinite non-cancellative commutative monoid
- Not cancellative, because multiplication by ab is not injective:
-
ab ⋅ a3b = ab and ab ⋅ 1 = ab, however a3b ≠ 1
- Commutative Gröbner basis: ⟨a, b | a3b2=b⟩
- 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,aaabb=b ab
ba=ab
aaabb=b
The mapping is from the listed presentation's alphabet to the current rewriting system's alphabet.
5 total
| Σ | # | Presentation | Mapping |
| 10 | 7025 | ⟨a, b | ba=ab, aabab=b⟩ | φ(a) = a, φ(b) = b |
| 10 | 7027 | ⟨a, b | ba=ab, aabba=b⟩ | φ(a) = a, φ(b) = b |
| 10 | 7029 | ⟨a, b | ba=ab, abaab=b⟩ | φ(a) = a, φ(b) = b |
| 10 | 7031 | ⟨a, b | ba=ab, ababa=b⟩ | φ(a) = a, φ(b) = b |
| 10 | 7032 | ⟨a, b | ba=ab, abbba=a⟩ | φ(a) = b, φ(b) = a |