A Reidemeister type theorem for petal diagrams of knots
From MaRDI portal
Publication:2329362
Abstract: We study petal diagrams of knots, which provide a method of describing knots in terms of permutations in a symmetric group . We define two classes of moves on such permutations, called trivial petal additions and crossing exchanges, which do not change the isotopy class of the underlying knot. We prove that any two permutations which represent isotopic knots can be related by a sequence of these moves and their inverses.
Recommendations
Cites work
- A combinatorial description of knot Floer homology
- Arc-presentations of links: Monotonic simplification
- Crossing numbers of random two-bridge knots
- Embedding knots and links in an open book. I: Basic properties
- Grid diagrams and Khovanov homology
- Grid Diagrams, Braids, and Contact Geometry
- Invariants of random knots and links
- Knot projections with a single multi-crossing
- Minimal generating sets of Reidemeister moves
- Models of random knots
- On combinatorial link Floer homology
- Random knots using Chebyshev billiard table diagrams
- The distribution of knots in the Petaluma model
Cited in
(7)- Unknotted cycles
- Petal projections, knot colorings and determinants
- Petal number of torus knots using superbridge indices
- Virtual multicrossings and petal diagrams for virtual knots and links
- A lower bound on the average genus of a 2-bridge knot
- Petal grid diagrams of torus knots
- From integrals to combinatorial formulas of finite type invariants -- a case study
This page was built for publication: A Reidemeister type theorem for petal diagrams of knots
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2329362)