#21751 ⟨a, b | aaa=1, abbbbbb=b⟩

Up:Monoid enumeration
Prev:#21749 ⟨a, b | aaa=1, abbbbba=b⟩
Next:#21760 ⟨a, b | aaa=1, baabaab=a⟩

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.
An idempotent element x satisfies x2 = x.
The order of x is the least n (if it exists) such that xn = 1.
The index and period of x is the least m (index) and n (period) such that x(m+n) = xm.

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. b16 ⇒ b [5]
2. ab ⇒ b11 [4]
3. a3 ⇒ 1 [1]
# ab:aaa=1,abbbbbb=b b/a - -
bbbbbbbbbbbbbbbb=b
ab=bbbbbbbbbbb
aaa=1

Same cardinality

4 unique, 17 total

Σ#PresentationPropertiesφ
103771⟨a, b | aaaa=bb, abab=1⟩Grp 485
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

Isomorphic instances

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

1 total

Σ#PresentationMapping
1122326⟨a, b | aaa=1, bbbbbb=ab⟩φ(a) = aa, φ(b) = b