An algorithm for generating a family of alternating knots

DOI10.5402/2012/804829MaRDI QIDQ415783zbMATH OpenOpenAlexWikidataFDO

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)

Review text

Summary: An algorithm for generating a family of alternating knots (which are described by means of a chain code) is presented. The family of alternating knots is represented on the cubic lattice, that is, each alternating knot is composed of constant orthogonal straight-line segments and is described by means of a chain code. This chain code is represented by a numerical string of finite length over a finite alphabet, allowing the usage of formal-language techniques for alternating-knot representation. When an alternating knot is described by a chain, it is possible to obtain its mirror image in an easy way. Also, we have a compression efficiency for representing alternating knots, because chain codes preserve information and allow a considerable data reduction.

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

• A METHOD FOR COMPUTING FAMILIES OF DISCRETE KNOTS USING KNOT NUMBERS
• scientific article; zbMATH DE number 1037084 (Why is no real title available?)
• scientific article; zbMATH DE number 3290993 (Why is no real title available?)
• 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)

• Crossing information and warping polynomials about the trefoil knot
• 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
• AN EASY AND FAST ALGORITHM FOR OBTAINING MINIMAL DISCRETE KNOTS

Describes a project that uses

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)