ALGORITHM FOR FINDING BOUNDARY LINK SEIFERT MATRICES
From MaRDI portal
Publication:5483328
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.
Recommendations
- An algorithm for computing the Seifert matrix of a link from a braid representation
- An algorithm to calculate generalized Seifert matrices
- Seifert complex for links and \(2\)-variable Alexander matrices
- Studying the multivariable Alexander polynomial by means of Seifert surfaces
- An algorithm for constructing the rectangular diagrams of a Seifert surface
Cites work
- A Seifert-matrix interpretation of Cappell and Shaneson's approach to link cobordisms
- Forme de Blanchfield et cobordisme d'entrelacs bord
- Hermitian forms on link modules
- Link cobordism
- Noncommutative rational functions and boundary links
- On S-equivalence of Seifert matrices
- On boundary-link cobordism
- Polynomial invariants of knots of codimension two
- Über das Geschlecht von Knoten
Cited in
(7)- An algorithm for constructing the rectangular diagrams of a Seifert surface
- An algorithm to calculate generalized Seifert matrices
- Homogeneous links and the Seifert matrix
- Seifert complex for links and \(2\)-variable Alexander matrices
- ALEXANDER POLYNOMIALS OF RIBBON LINKS
- scientific article; zbMATH DE number 125412 (Why is no real title available?)
- An algorithm for computing the Seifert matrix of a link from a braid representation
This page was built for publication: ALGORITHM FOR FINDING BOUNDARY LINK SEIFERT MATRICES
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5483328)
