#131 ⟨a, b | aaaabba=1⟩

Quick links

  1. Properties
  2. Rewriting system
  3. Other submonoids of same group
  4. Isomorphic instances

Properties

Rewriting system

Format:
Word to reduce:
Tips:
  • Lowercase letters stand for generators.
  • Spaces are ignored.
  • Numbers repeat the previous letter, e.g. b90.
Reduction strategy:
Path to normal form: 1
1
#RuleProof
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

Other submonoids of same group

7 unique, 7 total

Σ#PresentationDescriptionRelated
7196a, b | abbbba=bInfinite cancellative non-commutative monoid
7199a, b | aaaaa=bbInfinite cancellative non-commutative monoid
7232a, b | abbba=bbInfinite cancellative non-commutative monoid
7237a, b | aaaa=babInfinite cancellative non-commutative monoid
7268a, b | abba=bbbInfinite cancellative non-commutative monoid
102333a, b | abababa=babInfinite cancellative non-commutative monoid
102767a, b | babab=ababaInfinite cancellative non-commutative monoid

Isomorphic instances

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

11 total

Σ#PresentationMapping
7137a, b | aaabbaa=1⟩φ(a) = a, φ(b) = b
7160a, b | abbbbba=1⟩φ(a) = b, φ(b) = a
9605a, b | aaaaababa=1⟩φ(a) = a, φ(b) = aaaadb
9615a, b | aaaababaa=1⟩φ(a) = a, φ(b) = aaaadb
9633a, b | aaababaaa=1⟩φ(a) = a, φ(b) = aaaadb
9695a, b | abaaaaaab=1⟩φ(a) = a, φ(b) = aaaadb
112795a, b | aaaaaabaaba=1⟩φ(a) = a, φ(b) = aaaadbaaaad
112813a, b | aaaaabaabaa=1⟩φ(a) = a, φ(b) = aaaadbaaaad
112847a, b | aaaabaabaaa=1⟩φ(a) = a, φ(b) = aaaadbaaaad
113005a, b | aabaaaaaaab=1⟩φ(a) = a, φ(b) = aaaadaaaadb
113170a, b | abaaaaaaaba=1⟩φ(a) = a, φ(b) = aaaadbaaaad