Events
Department of Mathematics and Statistics
Texas Tech University
See this PDF
Skein manipulations prove to be computationally intensive due to the exponential nature of skein relations. Resolving each crossing in a knot diagram produces 2 new knot diagrams; knot diagrams with over 5 crossings become increasingly difficult to work with. In this talk, I will introduce a method for automating these computations and discuss how this method was implemented as a Python program. I will illustrate the use of the program in several known examples, demonstrating how examples obtained through several months of work can be can now be obtained in less than 5 minutes. This program will be used to generate a library of examples for testing various conjectures in Chern-Simons theory.