An algorithm for generating a family of alternating knots

DOI10.5402/2012/804829zbMATH Open1239.57002OpenAlexW2040706230WikidataQ58692490 ScholiaQ58692490MaRDI QIDQ415783FDOQ415783

Authors Carlos Velarde, Ernesto Bribiesca, Wendy Aguilar 

Publication date 9 May 2012

Published in ISRN Algebra (Search for Journal in Brave)

Full work available at URL https://doi.org/10.5402/2012/804829

zbMATH Keywords

algorithmalternating knotschain codecubic latticemirror image

Mathematics Subject Classification ID

Software, source code, etc. for problems pertaining to manifolds and cell complexes (57-04) Other types of codes (94B60)

Recommendations

• ENUMERATING THE PRIME ALTERNATING KNOTS, PART I
• ENUMERATING THE PRIME ALTERNATING KNOTS, PART II
• A METHOD FOR COMPUTING FAMILIES OF DISCRETE KNOTS USING KNOT NUMBERS
• DISCRETE KNOTS
• Algorithms for low-dimensional topology

Cites Work

• scientific article; zbMATH DE number 1037084 (Why is no real title available?)
• scientific article; zbMATH DE number 3290993 (Why is no real title available?)
• A METHOD FOR COMPUTING FAMILIES OF DISCRETE KNOTS USING KNOT NUMBERS
• MINIMAL KNOTS IN THE CUBIC LATTICE
• MINIMAL KNOTTED POLYGONS ON THE CUBIC LATTICE
• The number of smallest knots on the cubic lattice
• Virtual knot theory

Cited In (5)

• A METHOD FOR COMPUTING FAMILIES OF DISCRETE KNOTS USING KNOT NUMBERS
• AN EASY AND FAST ALGORITHM FOR OBTAINING MINIMAL DISCRETE KNOTS
• ENUMERATING THE PRIME ALTERNATING KNOTS, PART II
• Crossing information and warping polynomials about the trefoil knot
• ENUMERATING THE PRIME ALTERNATING KNOTS, PART I

Uses Software

• Haskell

This page was built for publication: An algorithm for generating a family of alternating knots

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