The number of smallest knots on the cubic lattice (Q1897020)

From MaRDI portal
scientific article
Language Label Description Also known as
English
The number of smallest knots on the cubic lattice
scientific article

    Statements

    The number of smallest knots on the cubic lattice (English)
    0 references
    10 April 1996
    0 references
    Polygons on the cubic lattice are piecewise linear simple closed curves such that each linear piece is of unit length and its vertices are on the cubic lattice. Such polygons are used to simulate the behavior of (thick) random closed curves found in models from chemistry and physics. Knotting of such polygons is an interesting problem. It has been shown that a polygon on the cubic lattice needs at least 24 edges to form a knot. It is shown that the only knots one can obtain with 24 edges are the trefoils. Furthermore, by classifying the projections of the polygons on a plane, we are able to enumerate all possible knotted polygons on the cubic lattice with 24 edges. The number of such unrooted knots on the cubic lattice is 3496.
    0 references
    self-avoiding walks
    0 references
    polygons on the cubic lattice
    0 references
    knot
    0 references
    knotted polygons on the cubic lattice with 24 edges
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references