pith. sign in

arxiv: 1210.6934 · v2 · pith:XS5GYMLRnew · submitted 2012-10-25 · 🧮 math.GT

The Theory of Pseudoknots

classification 🧮 math.GT
keywords pseudoknotscrossingcrossingsdiagramsintroduceknotnumberpasses
0
0 comments X
read the original abstract

Classical knots in $\mathbb{R}^3$ can be represented by diagrams in the plane. These diagrams are formed by curves with a finite number of transverse crossings, where each crossing is decorated to indicate which strand of the knot passes over at that point. A pseudodiagram is a knot diagram that may be missing crossing information at some of its crossings. At these crossings, it is undetermined which strand passes over. Pseudodiagrams were first introduced by Ryo Hanaki in 2010. Here, we introduce the notion of a pseudoknot, i.e. an equivalence class of pseudodiagrams under an appropriate choice of Reidemeister moves. In order to begin a classification of pseudoknots, we introduce the concept of a weighted resolution set, an invariant of pseudoknots. We compute the weighted resolution set for several pseudoknot families and discuss notions of crossing number, homotopy, and chirality for pseudoknots.

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.