Skip to content

An efficient algorithm to compute the colored Jones polynomial. Described at https://arxiv.org/abs/1804.07910

Notifications You must be signed in to change notification settings

jsflevitt/color-Jones-from-walks

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

3 Commits
 
 
 
 
 
 
 
 
 
 

Repository files navigation

======= An Algorithm to Compute the Colored Jones Polynomial

Author: Jesse S. F. Levitt

Date: Sept 2017

Version: 1.0


This is a Mathematica script to compute the Colored Jones polynomial using the Walk on braid model by Cody Armond refined from the work of Vu Huynh and Thắng Lê.

Full Installation instructions will be uploaded soon.

A brief tutorial will be uploaded eventually.

If your computer does not have a C compiler use the ColorJonesNoCCode.wl file, otherwise the ColorJones.wl file is more efficient.

This file was last edited on 4/20/2018

About

An efficient algorithm to compute the colored Jones polynomial. Described at https://arxiv.org/abs/1804.07910

Resources

Stars

Watchers

Forks

Releases

No releases published

Packages

No packages published