We show that any link has a Seifert surface\nin the standard form, and thereby present a new way of coding a link. We\npresent an algorithm to read the code directly from a braid presentation.doi:10.1112/BLMS/BDN020Rei Furihata
4) surface [英]['sɜ:fɪs] [美]['sɝfɪs] 曲面 1. Research on Surface NC Machining Accuracy; 曲面数控加工精度的研究 2. Algorithm for generation of free gou tool path on sculptural surface; 复杂曲面的无干涉刀位轨迹生成 3. Development of Study on Numerically Controlled ...
Seifert gave an explicit algorithm for finding a Seifert surface from a link diagram. In 1969 Erle [7] proved that any embedding M^n\subset {\mathbb {R}}^{n+2} of codimension two of a closed oriented connected manifold M has a trivial normal bundle and admits a Seifert hypersurface \...
KNOT theoryFrom classical knot theory we know that every knot in S 3 is the boundary of an oriented, embedded surface. A standard demonstration of this fact achieved by elementary techniques comes from taking a regular projection of any knot and employing Seifert's constructive algorithm. In ...
We show that any link has a Seifert surface in the standard form, and thereby present a new way of coding a link. We present an algorithm to read the code directly from a braid presentation.doi:10.1112/blms/bdn020Furihata ReiHirasawa Mikami...
We finally give an algorithm to produce a set of decomposition diagrams for a spanning surface of a knot in petal form and prove that for incompressible surfaces such decomposition diagrams are unique up to perturbation moves.Brigham Young University.;Brigham Young University.;Brigham Young University...
Seifert surfaceknot theoryminimal complexity surfacesThurston normThis 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 ...