pith. sign in

arxiv: math/0305405 · v2 · submitted 2003-05-28 · 🧮 math.GT

Algorithm for finding boundary link Seifert matrices

classification 🧮 math.GT
keywords algorithmseifertalexanderboundaryfindinggivenlinkmatrices
0
0 comments X
read the original abstract

We explain an algorithm for finding a boundary link Seifert matrix for a given Alexander polynomial. The algorithm depends on several choices and therefore makes it possible to find non-equivalent Seifert matrices for a given Alexander polynomial.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.