ALGORITHM FOR FINDING BOUNDARY LINK SEIFERT MATRICES
From MaRDI portal
Publication:5483328
DOI10.1142/S0218216506004622zbMATH Open1100.57007arXivmath/0305405MaRDI QIDQ5483328FDOQ5483328
Authors: Stefan Friedl
Publication date: 14 August 2006
Published in: Journal of Knot Theory and Its Ramifications (Search for Journal in Brave)
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.
Full work available at URL: https://arxiv.org/abs/math/0305405
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
- Über das Geschlecht von Knoten
- Polynomial invariants of knots of codimension two
- On S-equivalence of Seifert matrices
- A Seifert-matrix interpretation of Cappell and Shaneson's approach to link cobordisms
- Link cobordism
- Hermitian forms on link modules
- Forme de Blanchfield et cobordisme d'entrelacs bord
- On boundary-link cobordism
- Noncommutative rational functions and boundary links
Cited In (5)
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)