#4118 ⟨a, b | bbb=aaa, abab=1⟩

Up:Monoid enumeration
Prev:#4107 ⟨a, b | bab=aaa, bbbb=1⟩
Next:#4120 ⟨a, b | aab=aaa, aba=a⟩

Contents

  1. Properties
  2. Finite structure
  3. Right Cayley graph
  4. Left Cayley graph
  5. Rewriting system
  6. Isomorphic instances

Properties

Finite structure

Elements in the center commute with all other elements.
The order of x is the least n such that xn = 1.

Right Cayley graph

Left Cayley graph

Rewriting system

Format:
Word:
Enter a word above to compute its normal form. Tips:
  • Lowercase letters stand for generators.
  • Spaces are ignored.
  • Numbers repeat the previous letter, e.g. b90.
Strategy:
Result: 1 
1
#RuleProof
1. a24 ⇒ 1 [10]
2. a3b ⇒ ba3 [3]
3. b2 ⇒ aba4 [4]
4. bab ⇒ a23 [9]
5. ba2b ⇒ a2ba17 [8]
# ab:bbb=aaa,abab=1 a/b - -
aaaaaaaaaaaaaaaaaaaaaaaa=1
aaab=baaa
bb=abaaaa
bab=aaaaaaaaaaaaaaaaaaaaaaa
baab=aabaaaaaaaaaaaaaaaaa

Isomorphic instances

The mapping is from the listed presentation's alphabet to the current rewriting system's alphabet.

7 total

Σ#PresentationMapping
1126062⟨a, b | aa=1, abababbbb=1⟩φ(a) = ab, φ(b) = a
1126071⟨a, b | aa=1, ababbbbab=1⟩φ(a) = ab, φ(b) = a
1126105⟨a, b | aa=1, abbbbabab=1⟩φ(a) = ab, φ(b) = a
1126150⟨a, b | aa=1, babababbb=1⟩φ(a) = ab, φ(b) = a
1126173⟨a, b | aa=1, bbabababb=1⟩φ(a) = ab, φ(b) = a
1126680⟨a, b | aa=1, bababbbb=a⟩φ(a) = ab, φ(b) = a
1126688⟨a, b | aa=1, babbbbab=a⟩φ(a) = ab, φ(b) = a