#6305 ⟨a, b | aaa=b, abbbb=b⟩

Contents

  1. Properties
  2. Commutative structure
  3. Finite structure
  4. Staircase diagram
  5. Cayley table
  6. Right Cayley graph
  7. Rewriting system
  8. Same cardinality
  9. Isomorphic instances

Properties

Commutative structure

Finite structure

An idempotent element x satisfies x2 = x.
The index and period of x is the least m (index) and n (period) such that x(m+n) = xm.

Staircase diagram

Cayley table

Idempotents are shown in bold.

1aa2a3a4a5a6a7a8a9a10a11a12
11aa2a3a4a5a6a7a8a9a10a11a12
aaa2a3a4a5a6a7a8a9a10a11a12a3
a2a2a3a4a5a6a7a8a9a10a11a12a3a4
a3a3a4a5a6a7a8a9a10a11a12a3a4a5
a4a4a5a6a7a8a9a10a11a12a3a4a5a6
a5a5a6a7a8a9a10a11a12a3a4a5a6a7
a6a6a7a8a9a10a11a12a3a4a5a6a7a8
a7a7a8a9a10a11a12a3a4a5a6a7a8a9
a8a8a9a10a11a12a3a4a5a6a7a8a9a10
a9a9a10a11a12a3a4a5a6a7a8a9a10a11
a10a10a11a12a3a4a5a6a7a8a9a10a11a12
a11a11a12a3a4a5a6a7a8a9a10a11a12a3
a12a12a3a4a5a6a7a8a9a10a11a12a3a4

Right Cayley graph

Idempotents are shown in bold.

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. a13 ⇒ a3 [2]
2. b ⇒ a3 [1]
# ab:aaa=b,abbbb=b a/b - -
aaaaaaaaaaaaa=aaa
b=aaa

Same cardinality

26 unique, 301 total

Σ#PresentationPropertiesDescriptionφ
91328⟨a, b | aaaa=b, abbb=1⟩Grp Com 13ℤ13189
92118⟨a, b | aba=b, baab=a⟩Noc 134
104642⟨a, b | aaaa=b, abbb=a⟩Noc Com 13ℕ(13 = 1)10
104643⟨a, b | aaaa=b, abbb=b⟩Noc Com 13ℕ(13 = 4)6
104683⟨a, b | aaab=b, abba=a⟩Noc 1316
105065⟨a, b | aaa=ab, babb=b⟩Noc 137
105334⟨a, b | aaa=ab, bba=bb⟩Noc 13
105336⟨a, b | aaa=ab, bbb=ab⟩Noc 131
105337⟨a, b | aaa=ab, bbb=ba⟩Noc 13
105340⟨a, b | aaa=bb, aab=ba⟩Noc 13
107143⟨a, b | bb=aa, aaab=ba⟩Noc 131
1112240⟨a, b | aaab=aa, bbbb=a⟩Noc Com 13ℕ(13 = 8)1
1112268⟨a, b | aaab=ab, bbbb=a⟩Noc Com 13ℕ(13 = 5)3
1112324⟨a, b | aaab=bb, bbbb=a⟩Noc Com 13ℕ(13 = 2)14
1114647⟨a, b | aaba=b, babbb=a⟩Noc Com 132
1115520⟨a, b | aaa=bb, aabbb=b⟩Noc Com 132
1116012⟨a, b | aaa=ab, abbb=bb⟩Noc 13
1116069⟨a, b | aaa=bb, abbb=ba⟩Noc 131
1116205⟨a, b | aab=ab, bbbb=aa⟩Noc 132
1116459⟨a, b | aba=bb, abbb=aa⟩Noc 131
1116506⟨a, b | aab=ab, bbb=aaa⟩Noc 131
1116515⟨a, b | aab=ba, bbb=aaa⟩Noc 13
1118958⟨a, b | aab=a, bbbbbb=a⟩Noc Com 13ℕ(13 = 6)4
1120046⟨a, b | aab=a, bbbb=bba⟩Noc 13
1120927⟨a, b | ab=aa, aaaa=bbb⟩Noc 137
1120991⟨a, b | ab=aa, baaa=bbb⟩Noc 133

Isomorphic instances

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

2 total

Σ#PresentationMapping
106313⟨a, b | aaa=b, babbb=b⟩φ(a) = a, φ(b) = aaa
106315⟨a, b | aaa=b, bbabb=b⟩φ(a) = a, φ(b) = aaa