Algorithm for finding boundary link Seifert matrices
Stefan Friedl
math.GTarXiv:math/0305405
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.
Create a lesson
Related papers
Mapping class groups have a unique Polish group structure
Tyrone Ghaswala, Sumun Iyer, Robert Alonzo Lyman et al.
Around the Andreadakis-Johnson filtration
Yusuke Kuno
Mapping class groups of simply connected closed spin 5-manifolds with no 2- and 3-torsion in homology
Huize Jin
A note on surfaces with large systoles
Yifei Cai
Real ideal points, Conway spheres, and left-orderable Dehn fillings
Yi Wang
All once-extended 3D TQFTs are Reshetikhin--Turaev theories
Glen Lim