Algorithm for computing Representations of the Braid Group and Temperley-Lieb algebra

Abstract: The braid group appears in many scientific fields and its representations are instrumental in understanding topological quantum algorithms, topological entropy, classification of manifolds and so on. In this work, we study planer diagrams which are Kauffman's reduction of the braid group algebra to the Temperley-Lieb algebra. We introduce an algorithm for computing all planer diagrams in a given dimension. The algorithm can also be used to multiply planer diagrams and find their matrix representation.