The goal of this paper is to tabulate all prime links in the thickened torus [Formula: see text] having diagrams having crossing number 5. First, we construct a table of prime projections of links on the torus [Formula: see text] having exactly 5 crossings. To this end, we enumerate abstract quadrivalent graphs of special type and consider all possible embeddings of the graphs into the torus [Formula: see text] in order to construct prime projections. Then, we prove that all obtained projections are inequivalent. Second, we use the list of prime projections to construct a table of diagrams of prime links in the torus [Formula: see text]. In order to prove that all those links are inequivalent, we use two modifications of the Kauffman bracket. Several known and new tricks allow us to keep the process within reasonable limits and rigorously theoretically prove the completeness of the constructed tables.
In the present paper, we develop a picture formalism which gives rise to an invariant that dominates several known invariants of classical and virtual knots: the Jones polynomial [Formula: see text], the Kuperberg bracket [Formula: see text], and the normalized arrow polynomial [Formula: see text].
We present a table of knots in a thickened torus T × I the diagrams of which have less than five crossing points. The knots are constructed by a three-step process: enumeration of regular graphs of degree 4, enumeration of all corresponding knot projections for each graph, and construction of minimal diagrams. The completeness of the table is proved.
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.