CONSTRUCTING SEIFERT SURFACES FROM n-BRIDGE LINK PROJECTIONS
2010 ◽
Vol 19
(03)
◽
pp. 313-334
This paper presents a new algorithm for constructing Seifert surfaces from n-bridge projections of links. The algorithm, 𝔄, 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.
2000 ◽
Vol 102
(1)
◽
pp. 89-100
◽
2021 ◽
Vol 70
(2)
◽
pp. 525-534
1985 ◽
Vol 16
(4)
◽
pp. 256-260
Keyword(s):
2013 ◽
Vol 042
(06)
◽
Keyword(s):
Keyword(s):