New presentations of a link and virtual link
From MaRDI portal
Publication:5223426
Abstract: New presentations of a link and a virtual link are introduced and algebraic systems on links and virtual links are constructed respectively. Based on the algebraic systems, Reduction Crossing Algorithms for them are proposed which are used to reduce the number of crossings in a link and virtual link. For known unknots, one can transform them into a trivial knot in a polynomial time by applying corresponding algorithm. As special consequences, Goeritz's unknot and Thistlethwaite's unknot are unknotted. Moreover, an infinite family of knots are unknotted in time where is the number of crossings in each for .
Recommendations
Cites work
- scientific article; zbMATH DE number 3179262 (Why is no real title available?)
- scientific article; zbMATH DE number 3530652 (Why is no real title available?)
- scientific article; zbMATH DE number 791397 (Why is no real title available?)
- scientific article; zbMATH DE number 3321941 (Why is no real title available?)
- 2-bridge knot boundary slopes: Diameter and genus
- A note on two problems in connexion with graphs
- A polynomial upper bound on Reidemeister moves
- A spanning tree expansion of the Jones polynomial
- Arc-presentations of links: Monotonic simplification
- Classification of knot projections
- Jones polynomials and classical conjectures in knot theory
- Knots are Determined by Their Complements
- On RAM Priority Queues
- State models and the Jones polynomial
- The computational complexity of knot and link problems
- Theorie der Normalflächen. Ein Isotopiekriterium für den Kreisknoten
- Virtual knot theory
This page was built for publication: New presentations of a link and virtual link
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5223426)