Pith. sign in

REVIEW

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

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

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

classification math.GT
keywords knotsh-latticelatticestickgivenhexagonalknotssimple
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
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$).

Discussion (0). Sign in to comment.

Pith tools