The number of smallest knots on the cubic lattice (Q1897020): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Set OpenAlex properties. |
||
(4 intermediate revisions by 3 users not shown) | |||
Property / author | |||
Property / author: Yuanan Diao / rank | |||
Property / author | |||
Property / author: Yuanan Diao / rank | |||
Normal rank | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: MINIMAL KNOTTED POLYGONS ON THE CUBIC LATTICE / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q5734792 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On the Number of Self-Avoiding Walks / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4693177 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Knots in random walks / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Knots in self-avoiding walks / rank | |||
Normal rank | |||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1007/bf02188227 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2081209072 / rank | |||
Normal rank |
Latest revision as of 11:54, 30 July 2024
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