| Up: | Monoids with two generators and one relation |
|---|---|
| Prev: | #130 ⟨a, b | aaaabab=1⟩ |
| Next: | #132 ⟨a, b | aaaabbb=1⟩ |
| # | Rule | Proof |
|---|---|---|
| 1. | b2 ⇒ d | [3] |
| 2. | ca ⇒ ac | [6] |
| 3. | cb ⇒ bc | [15] |
| 4. | cd ⇒ 1 | [9] |
| 5. | da ⇒ ad | [13] |
| 6. | db ⇒ bd | [5] |
| 7. | dc ⇒ 1 | [14] |
| 8. | a5 ⇒ c | [2] |
# ab:aaaabba=1 abcd aaaaa=c,bb=d magic:0 bb=d ca=ac cb=bc cd=1 da=ad db=bd dc=1 aaaaa=c
| Σ | # | Presentation | Description | Related |
|---|---|---|---|---|
| 7 | 196 | ⟨a, b | abbbba=b⟩ | Infinite cancellative non-commutative monoid | |
| 7 | 199 | ⟨a, b | aaaaa=bb⟩ | Infinite cancellative non-commutative monoid | |
| 7 | 232 | ⟨a, b | abbba=bb⟩ | Infinite cancellative non-commutative monoid | |
| 7 | 237 | ⟨a, b | aaaa=bab⟩ | Infinite cancellative non-commutative monoid | |
| 7 | 268 | ⟨a, b | abba=bbb⟩ | Infinite cancellative non-commutative monoid | |
| 10 | 2333 | ⟨a, b | abababa=bab⟩ | Infinite cancellative non-commutative monoid | |
| 10 | 2767 | ⟨a, b | babab=ababa⟩ | Infinite cancellative non-commutative monoid |
The mapping is from the listed presentation's alphabet to the current rewriting system's alphabet.
11 total
| Σ | # | Presentation | Mapping |
|---|---|---|---|
| 7 | 137 | ⟨a, b | aaabbaa=1⟩ | φ(a) = a, φ(b) = b |
| 7 | 160 | ⟨a, b | abbbbba=1⟩ | φ(a) = b, φ(b) = a |
| 9 | 605 | ⟨a, b | aaaaababa=1⟩ | φ(a) = a, φ(b) = aaaadb |
| 9 | 615 | ⟨a, b | aaaababaa=1⟩ | φ(a) = a, φ(b) = aaaadb |
| 9 | 633 | ⟨a, b | aaababaaa=1⟩ | φ(a) = a, φ(b) = aaaadb |
| 9 | 695 | ⟨a, b | abaaaaaab=1⟩ | φ(a) = a, φ(b) = aaaadb |
| 11 | 2795 | ⟨a, b | aaaaaabaaba=1⟩ | φ(a) = a, φ(b) = aaaadbaaaad |
| 11 | 2813 | ⟨a, b | aaaaabaabaa=1⟩ | φ(a) = a, φ(b) = aaaadbaaaad |
| 11 | 2847 | ⟨a, b | aaaabaabaaa=1⟩ | φ(a) = a, φ(b) = aaaadbaaaad |
| 11 | 3005 | ⟨a, b | aabaaaaaaab=1⟩ | φ(a) = a, φ(b) = aaaadaaaadb |
| 11 | 3170 | ⟨a, b | abaaaaaaaba=1⟩ | φ(a) = a, φ(b) = aaaadbaaaad |