An official website of the United States government
We consider homologically essential simple closed curves on Seifert surfaces of genus one knots in S3, and in particular those that are unknotted or slice in S3. We completely characterize all such curves for most twist knots: they are either positive or negative braid closures; moreover, we determine exactly which of those are unknotted. A surprising consequence of our work is that the figure eight knot admits infinitely many unknotted essential curves up to isotopy on its genus one Seifert surface, and those curves are enumerated by Fibonacci numbers. On the other hand, we prove that many twist knots admit homologically essential curves that cannot be positive or negative braid closures. Indeed, among those curves, we exhibit an example of a slice but not unknotted homologically essential simple closed curve. We further investigate our study of unknotted essential curves for arbitrary Whitehead doubles of non-trivial knots, and obtain that there is a precisely one unknotted essential simple closed curve in the interior of the doubles’ standard genus one Seifert surface. As a consequence of all these we obtain many new examples of 3-manifolds that bound contractible 4-manifolds.
more »
« less
Universal knot diagrams
We study collections of planar curves that yield diagrams for all knots. In particular, we show that a very special class called potholder curves carries all knots. This has implications for realizing all knots and links as special types of meanders and braids. We also introduce and apply a method to compare the efficiency of various classes of curves that represent all knots.
more »
« less
- Award ID(s):
- 1760485
- PAR ID:
- 10101452
- Date Published:
- Journal Name:
- Journal of Knot Theory and Its Ramifications
- Volume:
- 28
- Issue:
- 07
- ISSN:
- 0218-2165
- Page Range / eLocation ID:
- 1950031
- Format(s):
- Medium: X
- Sponsoring Org:
- National Science Foundation
More Like this
-
-
Abstract The central question of knot theory is that of distinguishing links up to isotopy. The first polynomial invariant of links devised to help answer this question was the Alexander polynomial (1928). Almost a century after its introduction, it still presents us with tantalizing questions, such as Fox’s conjecture (1962) that the absolute values of the coefficients of the Alexander polynomial $$\Delta _{L}(t)$$ of an alternating link $$L$$ are unimodal. Fox’s conjecture remains open in general with special cases settled by Hartley (1979) for two-bridge knots, by Murasugi (1985) for a family of alternating algebraic links, and by Ozsváth and Szabó (2003) for the case of genus $$2$$ alternating knots, among others. We settle Fox’s conjecture for special alternating links. We do so by proving that a certain multivariate generalization of the Alexander polynomial of special alternating links is Lorentzian. As a consequence, we obtain that the absolute values of the coefficients of $$\Delta _{L}(t)$$, where $$L$$ is a special alternating link, form a log-concave sequence with no internal zeros. In particular, they are unimodal.more » « less
-
Knot and link diagrams are projections of one or more 3-dimensional simple closed curves into lR2, such that no more than two points project to the same point in lR2. These diagrams are drawings of 4-regular plane multigraphs. Knots are typically smooth curves in lR3, so their projections should be smooth curves in lR2 with good continuity and large crossing angles: exactly the properties of Lombardi graph drawings (defned by circular-arc edges and perfect angular resolution). We show that several knots do not allow crossing-minimal plane Lombardi drawings. On the other hand, we identify a large class of 4-regular plane multigraphs that do have plane Lombardi drawings. We then study two relaxations of Lombardi drawings and show that every knot admits a crossing-minimal plane 2-Lombardi drawing (where edges are composed of two circular arcs). Further, every knot is near-Lombardi, that is, it can be drawn as a plane Lombardi drawing when relaxing the angular resolution requirement by an arbitrary small angular offset ε, while maintaining a 180◦ angle between opposite edges.more » « less
-
Computing the Fréchet distance between two polygonal curves takes roughly quadratic time. In this paper, we show that for a special class of curves the Fréchet distance computations become easier. Let [Formula: see text] and [Formula: see text] be two polygonal curves in [Formula: see text] with [Formula: see text] and [Formula: see text] vertices, respectively. We prove four results for the case when all edges of both curves are long compared to the Fréchet distance between them: (1) a linear-time algorithm for deciding the Fréchet distance between two curves, (2) an algorithm that computes the Fréchet distance in [Formula: see text] time, (3) a linear-time [Formula: see text]-approximation algorithm, and (4) a data structure that supports [Formula: see text]-time decision queries, where [Formula: see text] is the number of vertices of the query curve and [Formula: see text] the number of vertices of the preprocessed curve.more » « less
-
A well-known algorithm for unknotting knots involves traversing a knot diagram and changing each crossing that is first encountered from below. The minimal number of crossings changed in this way across all diagrams for a knot is called the ascending number of the knot. The ascending number is bounded below by the unknotting number. We show that for knots obtained as the closure of a positive braid, the ascending number equals the unknotting number. We also present data indicating that a similar result may hold for positive knots. We use this data to examine which low-crossing knots have the property that their ascending number is realized in a minimal crossing diagram, showing that there are at most 5 hyperbolic, alternating knots with at most 12 crossings with this property.more » « less
- Free Publicly Accessible Full Text
-
Accepted Manuscript1.0
- Journal Article:
- https://doi.org/10.1142/S0218216519500317
