#235 ⟨a, b, c | ab=1, abc=c⟩

Contents

  1. Properties
  2. Rewriting system
  3. Isomorphic instances

Properties

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. ab ⇒ 1 [1]
# abc:ab=1,abc=c abc - -
ab=1

Isomorphic instances

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

12 total

Σ#PresentationMapping
86807⟨a, b, c | ab=1, aabbc=c⟩φ(a) = a, φ(b) = b, φ(c) = 1
86851⟨a, b, c | ab=1, ababc=c⟩φ(a) = a, φ(b) = b, φ(c) = 1
86882⟨a, b, c | ab=1, abcab=c⟩φ(a) = a, φ(b) = b, φ(c) = 1
87306⟨a, b, c | ab=1, aabc=ac⟩φ(a) = a, φ(b) = b, φ(c) = 1
87350⟨a, b, c | ab=1, abac=ac⟩φ(a) = a, φ(b) = b, φ(c) = 1
87367⟨a, b, c | ab=1, abbc=bc⟩φ(a) = a, φ(b) = b, φ(c) = 1
87377⟨a, b, c | ab=1, abca=ca⟩φ(a) = a, φ(b) = b, φ(c) = 1
87387⟨a, b, c | ab=1, abcb=cb⟩φ(a) = a, φ(b) = b, φ(c) = 1
87397⟨a, b, c | ab=1, abcc=cc⟩φ(a) = a, φ(b) = b, φ(c) = 1
87480⟨a, b, c | ab=1, babc=bc⟩φ(a) = a, φ(b) = b, φ(c) = 1
87588⟨a, b, c | ab=1, cabc=cc⟩φ(a) = a, φ(b) = b, φ(c) = 1
87821⟨a, b, c | ab=1, cab=abc⟩φ(a) = a, φ(b) = b, φ(c) = 1