next up previous contents
Next: The Representation Up: The Andrews-Curtis Conjecture Previous: Contents   Contents

The Problem

We are designing this program to work with the exact presentation:
  G = < a , b ; abaBAB , AAbbb >
where lower case letters are generators and uppercase letters are their inverses. This presentation is known to be trivial. That is, it is known to be exactly:
  F = < a , b ; >
We are given 12 transformations. Each transformation specifies a way to rewrite the two relators. If the first relator is called x, its inverse is X, the second relator is called y, and its inverse is Y then we have the Andrews-Curtis Transformations: T1: x -> xy ; y -> y
next up previous contents
Next: The Representation Up: The Andrews-Curtis Conjecture Previous: Contents   Contents
root 2004-05-05