AN EASY AND FAST ALGORITHM FOR OBTAINING MINIMAL DISCRETE KNOTS

DOI10.1142/S021821650600466XzbMATH Open1099.57005OpenAlexW2092236052MaRDI QIDQ5483329FDOQ5483329

Authors: Ernesto Bribiesca 

Publication date: 14 August 2006

Published in: Journal of Knot Theory and Its Ramifications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1142/s021821650600466x

Recommendations

• Low complexity algorithms in knot theory
• An efficient algorithm to decide the knot problem
• Algorithmic simplification of knot diagrams: new moves and experiments
• A METHOD FOR COMPUTING FAMILIES OF DISCRETE KNOTS USING KNOT NUMBERS
• A Seifert algorithm for knotted surfaces
• Algorithms in low-dimensional topology: holonomic parametrization of knots
• An algorithm for generating a family of alternating knots
• On the efficiency of knot insertion algorithms
• scientific article; zbMATH DE number 3876217
• An ergodic algorithm for generating knots with a prescribed injectivity radius

zbMATH Keywords

unknotdigitalized knot representation

Mathematics Subject Classification ID

Cites Work

• Virtual knot theory
• Theorie der Normalflächen. Ein Isotopiekriterium für den Kreisknoten
• The number of smallest knots on the cubic lattice
• MINIMAL KNOTTED POLYGONS ON THE CUBIC LATTICE
• A METHOD FOR COMPUTING FAMILIES OF DISCRETE KNOTS USING KNOT NUMBERS
• A new algorithm for recognizing the unknot
• TOWARDS AN IMPLEMENTATION OF THE B–H ALGORITHM FOR RECOGNIZING THE UNKNOT
• DISCRETE KNOTS

Cited In (2)

• A METHOD FOR COMPUTING FAMILIES OF DISCRETE KNOTS USING KNOT NUMBERS
• Recognizing Knots Using Simulated Annealing

This page was built for publication: AN EASY AND FAST ALGORITHM FOR OBTAINING MINIMAL DISCRETE KNOTS

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5483329)