A METHOD FOR COMPUTING FAMILIES OF DISCRETE KNOTS USING KNOT NUMBERS

DOI10.1142/S0218216505003907zbMath1080.57007MaRDI QIDQ5316246

Ernesto Bribiesca

Publication date: 12 September 2005

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

zbMATH Keywords

cubic latticechain codingdiscrete knots

Mathematics Subject Classification ID

Related Items (2)

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

Cites Work

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

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