Abstract
This paper presents a new algorithm for constructing Seifert surfaces from n-bridge projections of links. The algorithm, 21, produces minimal complexity surfaces for large classes of braids and alternating links. In addition, we consider a family of knots for which canonical genus is strictly greater than genus, (gc(K) > g(K)), and show that builds surfaces realizing the knot genus g(K). We also present a generalization of Seifert's algorithm which constructs surfaces representing arbitrary relative second homology classes in a link complement.
Original language | English |
---|---|
Pages (from-to) | 313-334 |
Number of pages | 22 |
Journal | Journal of Knot Theory and its Ramifications |
Volume | 19 |
Issue number | 3 |
DOIs | |
Publication status | Published - Mar 2010 |
Externally published | Yes |