#2583 ⟨a, b | aaa=1, abbb=ab⟩
Contents
- Properties
- Rewriting system
- Isomorphic instances
- Sum of relation sides is 9
- Isomorphic to ℤ3 ∗ ℕ(3 = 1)
- Infinite non-cancellative non-commutative monoid
- Element aba has infinite order
- Not left cancellative, because left multiplication by b is not injective:
-
b ⋅ b2 = b and b ⋅ 1 = b, however b2 ≠ 1
- Not right cancellative, because right multiplication by b is not injective:
-
b2 ⋅ b = b and 1 ⋅ b = b, however b2 ≠ 1
- Reduction order:
- Left-to-right shortlex with a < b
- Certificate: derivations of all rewriting rules from the defining relations.
# ab:aaa=1,abbb=ab ab - -
aaa=1
bbb=b
The mapping is from the listed presentation's alphabet to the current rewriting system's alphabet.
5 total
| Σ | # | Presentation | Mapping |
| 10 | 7495 | ⟨a, b | aaa=1, aaabbb=b⟩ | φ(a) = a, φ(b) = b |
| 10 | 7535 | ⟨a, b | aaa=1, baaabb=b⟩ | φ(a) = a, φ(b) = b |
| 10 | 8037 | ⟨a, b | aaa=1, aaab=bbb⟩ | φ(a) = a, φ(b) = b |
| 11 | 22773 | ⟨a, b | aaa=1, aabbb=aab⟩ | φ(a) = a, φ(b) = b |
| 11 | 22812 | ⟨a, b | aaa=1, abbba=aba⟩ | φ(a) = a, φ(b) = b |