PL-embedding the dual of two Jordan curves into S 3 by an O(n 2)-algorithm
Abstract
Let be given a colored 3-pseudo-triangulation H with n tetrahedra. Colored means that each tetrahedron have vertices distinctively colored 0,1,2,3. In a pseudo 3-triangulation the intersection of simplices might be subsets of simplices of smaller dimensions (faces), instead of a single maximal face, as for true triangulations. If H is the dual of a cell 3-complex induced (in an specific way to be made clear) by a pair of Jordan curves with 2n transversal crossings, then we show that the induced 3-manifold |H| is S3 and we make available an O(n2)-algorithm to produce a PL-embedding (rourke1982introduction) of H into S3. This bound is rather surprising because such PL-embeddings are often of exponential size. This work is the first step towards obtaining, via an O(n 2)-algorithm, a framed link presentation inducing the same closed orientable 3-manifold as the one given by a colored pseudo-triangulation. Previous work on this topic appear in http://arxiv.org/abs/1212.0827, linsmachadoA2012, http://arxiv.org/abs/1212.0826, linsmachadoB2012 and http://arxiv.org/abs/1211.1953, linsmachadoC2012. However, the exposition and the new proofs of this paper are meant to be entirely self-contained.
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.