Abstract
We develop an algorithm for computing generalized Seifert matrices for colored links given as closures of colored braids. The algorithm has been implemented by the second author as a computer program called Clasper. Clasper also outputs the Conway potential function, the multivariable Alexander polynomial and the Cimasoni-Florens signatures of a link, and displays a visualization of the C-complex used for producing the generalized Seifert matrices.
Connections
Explore this paper’s authors, topics and related work.
Building this map preview
BZPEER is loading the nearby papers, people, topics and institutions for this page.
Reviews 0
Write a review
No reviews yet.
Discussion 0
Add a comment
No comments yet.