Demonstration program for I.Dynnikov's monotonic simplification algorithm

As part of my diplom work, I wrote a little python program, which demonstrates the working of an algorithm of I.Dynnikov to determine if a knot is trivial. The program allows its user to draw a knot, to transform it in a rectangular diagram and (if the knot is simple enough) to apply I.Dynnikov's algorithm in order to find out if the knot is trivial. Here is a zipped file of the source of the program, that can be executed with the help of a recent (2.3 or higher) version of the python interpreter. (Please, inform me if you find a bug.)

The zipped sources

You can find the latest version of the python interpreter at:

http://www.python.org/

The original source of the algorithm and a proof of its correctness are in the arxiv at:

math.GT/0208153

A Program calculating the knot Floer Homology

The following link contains a zipped still experimental python program that calculates the knot Floer homology of a knot. The program is started by executing main.py, its main output is an array containing for each Alexander and Maslov grading the rank of the homology. Please email me if you find a bug. The running time of the program is sometimes huge. Further faster versions should appear.
The program is based on the work of Stephen J. Bigelow and Anna Beliakova, itself prolongating the now classical combinatorial description of knot Floer homology.

The zipped sources

The program also uses an astonishing library called psyco, which can be found at the following adress:

Psyco homepage