#3771 ⟨a, b | aaaa=bb, abab=1⟩

Up:Monoid enumeration
Prev:#3770 ⟨a, b | aaaa=bb, aabb=1⟩
Next:#3773 ⟨a, b | aaaa=bb, abbb=1⟩

Contents

  1. Properties
  2. Finite structure
  3. Right Cayley graph
  4. Left Cayley graph
  5. Rewriting system
  6. Same cardinality
  7. 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 [13]
2. ab ⇒ ba19 [12]
3. b2 ⇒ a4 [1]
# ab:aaaa=bb,abab=1 a/b - -
aaaaaaaaaaaaaaaaaaaaaaaa=1
ab=baaaaaaaaaaaaaaaaaaa
bb=aaaa

Same cardinality

4 unique, 13 total

Σ#PresentationPropertiesφ
1114993⟨a, b | aaa=bb, ababbb=1⟩Grp 482
1116966⟨a, b | abab=1, aaabbba=1⟩Grp 486
1117503⟨a, b | abab=1, aabbaa=b⟩Grp 48
1121751⟨a, b | aaa=1, abbbbbb=b⟩Noc 481

Isomorphic instances

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

5 total

Σ#PresentationMapping
109464⟨a, b | aa=1, ababbbbb=1⟩φ(a) = ba, φ(b) = a
109481⟨a, b | aa=1, abbbbbab=1⟩φ(a) = ba, φ(b) = a
109504⟨a, b | aa=1, bababbbb=1⟩φ(a) = ba, φ(b) = a
109514⟨a, b | aa=1, bbababbb=1⟩φ(a) = ba, φ(b) = a
109786⟨a, b | aa=1, babbbbb=a⟩φ(a) = ba, φ(b) = a