A METHOD FOR COMPUTING FAMILIES OF DISCRETE KNOTS USING KNOT NUMBERS

DOI10.1142/S0218216505003907MaRDI QIDQ5316246zbMATH OpenFDO

Authors Ernesto Bribiesca

Publication date 12 September 2005

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

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

zbMATH Keywords

chain codingcubic latticediscrete knots

Mathematics Subject Classification ID

Recommendations

• DISCRETE KNOTS
• AN EASY AND FAST ALGORITHM FOR OBTAINING MINIMAL DISCRETE KNOTS
• scientific article; zbMATH DE number 1187105
• An algorithm for generating a family of alternating knots
• The number of smallest knots on the cubic lattice

Cites work

• Contacts in self-avoiding walks and polygons
• DISCRETE KNOTS
• Knots in self-avoiding walks
• MINIMAL KNOTS IN THE CUBIC LATTICE
• MINIMAL KNOTTED POLYGONS ON THE CUBIC LATTICE
• On the Number of Self-Avoiding Walks
• The number of smallest knots on the cubic lattice
• Virtual knot theory

Cited in

(2)

• An algorithm for generating a family of alternating knots
• AN EASY AND FAST ALGORITHM FOR OBTAINING MINIMAL DISCRETE KNOTS

This page was built for publication: A METHOD FOR COMPUTING FAMILIES OF DISCRETE KNOTS USING KNOT NUMBERS

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