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...[Show more]
Items in Open Research are protected by copyright, with all rights reserved, unless otherwise indicated.