The reviewed record of science sign in
Pith

arxiv: 2211.00687 · v2 · pith:MGLCXB6Y · submitted 2022-11-01 · math.GT

Bounds in simple hexagonal lattice and classification of 11-stick knots

Reviewed by Pith T0 review T1 audit T2 compute T3 formal T4 kernel pith:MGLCXB6Yrecord.jsonopen to challenge →

classification math.GT
keywords knotsh-latticelatticestickgivenhexagonalknotssimple
0
0 comments X
read the original abstract

The stick number and the edge length of a knot type in the simple hexagonal lattice (sh-lattice) are the minimal numbers of sticks and edges required, respectively, to construct a knot of the given type in sh-lattice. By introducing a linear transformation between lattices, we prove that for any given knot both values in the sh-lattice are strictly less than the values in the cubic lattice. Finally, we show that the only non-trivial 11-stick knots in the sh-lattice are the trefoil knot ($3_1$) and the figure-eight knot ($4_1$).

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.