Knot projections with a single multi-crossing
From MaRDI portal
Publication:5255348
Abstract: Introduced recently, an n-crossing is a singular point in a projection of a link at which n strands cross such that each strand travels straight through the crossing. We introduce the notion of an "ubercrossing projection, a knot projection with a single n-crossing. Such a projection is necessarily composed of a collection of loops emanating from the crossing. We prove the surprising fact that all knots have a special type of "ubercrossing projection, which we call a petal projection, in which no loops contain any others. The rigidity of this form allows all the information about the knot to be concentrated in a permutation corresponding to the levels at which the strands lie within the crossing. These ideas give rise to two new invariants for a knot K: the "ubercrossing number "u(K), and petal number p(K). These are the least number of loops in any "ubercrossing or petal projection of K, respectively. We relate "u(K) and p(K) to other knot invariants, and compute p(K) for several classes of knots, including all knots of nine or fewer crossings.
Recommendations
Cites work
- An upper bound of arc index of links
- Embedding knots and links in an open book. I: Basic properties
- Knots and contact geometry. I: Torus knots and the figure eight knot.
- Polygon Indices and Superbridge Indices of Torus Knots and Links
- Quadruple crossing number of knots and links
- Triple crossing number of knots and links
Cited in
(21)- Learning knot invariants across dimensions
- A lower bound on the average genus of a 2-bridge knot
- Petal number of torus knots of type (r,r + 2)
- Virtual multicrossings and petal diagrams for virtual knots and links
- Invariants of random knots and links
- On the number of unknot diagrams
- Bounds on übercrossing and petal numbers for knots
- Multi-crossing number for knots and the Kauffman bracket polynomial
- Random knots using Chebyshev billiard table diagrams
- Crossing numbers of random two-bridge knots
- Triple-crossing number and moves on triple-crossing link diagrams
- Petal projections, knot colorings and determinants
- A Reidemeister type theorem for petal diagrams of knots
- Universal knot diagrams
- Geometric knot theory. Abstracts from the workshop held April 28 -- May 4, 2013.
- Petal grid diagrams of torus knots
- The distribution of knots in the Petaluma model
- Models of random knots
- Turning Knots into Flowers and Related Undergraduate Research
- Structure and enumeration of \(K_4\)-minor-free links and link-diagrams
- Petal number of torus knots using superbridge indices
This page was built for publication: Knot projections with a single multi-crossing
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5255348)
