Parity in Knotoids
Neslihan G\"ug\"umc\"u, Louis Kauffman

TL;DR
This paper explores the parity concept in knotoids, demonstrating the non-surjectivity of the virtual closure map, introducing a planar parity bracket polynomial, and proving a conjecture about minimal diagrams of knot-type knotoids.
Contribution
It introduces a planar parity bracket polynomial for knotoids and proves a conjecture on minimal diagrams, advancing the understanding of knotoid invariants and their relation to virtual knots.
Findings
Virtual closure map is not surjective.
Introduces planar parity bracket polynomial for knotoids.
Proves minimal diagrams of knot-type knotoids have zero height.
Abstract
This paper investigates the parity concept in knotoids in and in in relation with virtual knots. We show that the virtual closure map is not surjective and give specific examples of virtual knots that are not in the image. We introduce a planar version of the parity bracket polynomial for knotoids in . By using the Nikonov/Manturov theorem on minimal diagrams of virtual knots we prove a conjecture of Turaev showing that minimal diagrams of knot-type knotoids have zero height.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsGeometric and Algebraic Topology · Botulinum Toxin and Related Neurological Disorders · Homotopy and Cohomology in Algebraic Topology
Parity in Knotoids
Neslihan Gügümcü
and
Louis H.Kauffman
Neslihan Gügümcü
Louis H.Kauffman:Department of Mathematics, Statistics and Computer Science, University of Illinois at Chicago, 851 South Morgan St., Chicago IL 60607-7045, U.S.A. and Department of Mechanics and Mathematics Novosibirsk State University Novosibirsk Russia
Abstract.
This paper investigates the parity concept in knotoids in and in in relation with virtual knots. We show that the virtual closure map is not surjective and give specific examples of virtual knots that are not in the image. We introduce a planar version of the parity bracket polynomial for knotoids in . By using the Nikonov/Manturov theorem on minimal diagrams of virtual knots we prove a conjecture of Turaev showing that minimal diagrams of knot-type knotoids have zero height.
1. Introduction
Knotoids [24] are knot diagrams with free ends (with the ends possibly in distinct planar regions of the diagram), taken up to classical Reidemeister moves. The moves are not allowed to pass an arc across an end of the diagram. Turaev suggests knotoids as abbreviated knot diagrams that provide an ease of computation of knot invariants. In fact, knotoids can be considered to be a significant extension of classical knot theory, and are worth studying for their own properties. Knotoids in also extend knots in and bring up many interesting features and problems such as the existence of parity in knotoid diagrams.
After an overview on knotoids and virtual knots and a discussion on the knotoid invariants, the loop bracket polynomial and the arrow polynomial in Section 2.1, we study the Gauss codes of knotoid diagrams in Section 3. We observe that during a traverse (a walk along the diagram) of a knotoid diagram in and in , each crossing can be called odd or even according to whether one meets an even or an odd number of other crossings in the walk from the given crossing and returning to it. See Figure 1. Note that the parity of the crossing in Figure 1 is an odd crossing.
Virtual knots represented by knots in thickened surfaces of arbitrary genus, also admit parity of this kind. Parity is an important theme in virtual knot theory and is related to a number of virtual knot invariants such as the odd writhe, the parity bracket polynomial, the affine index polynomial and the arrow polynomial.
In Section 4 we study knotoids in relation with virtual knots. The endpoints of a knotoid can be connected to obtain a virtual knot called the virtual closure of the knotoid. Knotoids are related to virtual knots of genus at most through the virtual closure map. Many knotoid invariants are defined by applying virtual knot invariants to the virtual closure of the knotoid. In this way we invoke virtual parity in studying knotoids, and in many cases the induced invariants can be defined directly in terms of knotoids. This is the case for the odd writhe [8], the parity bracket polynomial [8], the arrow polynomial [8] and the affine index polynomial [8]. Then issues of parity are referred directly to the knotoid diagrams.
In Section 4.0.1 we show that the virtual closure map is a non-surjective map by examining the surface bracket states of virtual knots lying in the image of the virtual closure map. The non-surjectivity of the virtual closure map for knotoids is important because the apparent structure of knotoids is quite different from the structure of virtual knots of genus no more than one. In particular we have conjectured that the Jones polynomial for knotoids detects the trivial knotoid [8]. This is not true for genus one virtual knots. Our examples show that an infinite class of genus one virtual knots of unit Jones polynomial are not in the image of the virtual closure map on knotoids. The problem remains open to fully understand the image of the virtual closure map.
Manturov shows that minimal genus representations of virtual knots admit minimal number of crossings by using a parity projection map. By using this result and the virtual closure we prove a conjecture of Turaev in Section 5: Minimal diagrams of knot-type knotoids (knotoids admitting diagrams whose endpoints lie in the same planar region) have zero complexity (we often refer to the complexity of a knotoid as its height). This gives us the following result: The crossing number of a knot-type knotoid is equal to the crossing number of the knot that is the closure of the knotoid.
2. Knotoids and virtual knots
2.1. Basics on knotoids
A knotoid diagram in an oriented surface [25] is an immersion of the unit interval into with a finite number of transversal double points, each of which is endowed with over or under information and called a
crossing of . The images of [math] and are the endpoints of . The endpoints are distinct from any of the crossings, and are called tail and head, respectively. admits an orientation from the tail to the head. Figure 2 shows an example of a knotoid diagram (in or ). The trivial knotoid diagram is an embedding of the unit interval in .
On knotoid diagrams in or in we allow Reidemeister I, II and III moves each taking place in a local disk free of endpoints, and isotopy of or , respectively.
Pulling/pushing the arc adjacent to an endpoint over or under a transversal arc, as shown in Figure 3, is a forbidden knotoid move. Notice that, if forbidden moves were allowed, any knotoid diagram in or in could be clearly turned into the trivial knotoid diagram.
A knotoid in (or a spherical knotoid) is an equivalence class of knotoid diagrams in considered up to the equivalence relation generated by the Reidemeister moves and isotopy in . A planar knotoid is an equivalence class of knotoid diagrams in taken up to the Reidemeister moves and the isotopy in .
Knotoids in extend classical knot theory [25]. Let be an oriented knot in (or in ) and be an oriented diagram of lying in . Cutting out an open arc from which is free of crossings results in a knotoid diagram with endpoints in the same local region of the diagram. This induces a well-defined injective map from the set of oriented knots in to the set of knotoids in [25]. The spherical knotoids obtained by this map are called knot-type knotoids. Knot-type knotoids admit at least one diagram with its endpoints lying in the same planar region, and they carry the same knottedness information with the knot they are associated with. The spherical knotoids that do not lie in the image of the map are called proper knotoids.
The map does not form a well-defined map when its image is considered to be the set of knotoids in . This is because unlike classical knots, considering a knotoid diagram in and in may result in two different knotoids since ‘Whitney flipping’ moves that pull a strand across the north pole are available for spherical knotoid diagrams. The reader can verify that the knotoid diagram in Figure 5 represents the trivial knotoid in although it can be verified by the loop bracket polynomial (see Section 2.1.1) that it is non-trivial as a planar knotoid. This implies that one can associate different planar knotoids to the trivial knot through the map .
Another aspect of knotoids in is that they can be considered as simpler representations of classical knots. Two types of classical closures, namely the underpass closure and the overpass closure, are available for a given knotoid diagram. In the underpass closure, two endpoints of a knotoid diagram are connected by an arc which is declared to go under the strands it encounters. This closure operation defines a well-defined and surjective map from the set of knotoids in to the set of oriented classical knots [25]. Note that the underpass closure is clearly a bijection on the set of knot-type knotoids. The knotoids closing to isotopic knots in through the underpass closure can be considered as knotoid representatives of the knots. Knotoid representatives of knots in reduce the computational complexity of knot invariants such as the knot group [25] since they may have less crossings than any knot diagrams.
2.1.1. Loop bracket polynomial
In [25] Turaev generalizes the Kauffman bracket to a -variable bracket polynomial for knotoids in . In Turaev’s -variable bracket polynomial, a variable is associated with the intersection number of the knotoid diagram with an arc chosen to connect the endpoints and also with the intersection number of the bracket states with the chosen arc, and another variable is associated with the number of circular state components enclosing the long state component containing the endpoints.
We restrict this polynomial by setting the variable that is associated to the intersection number of an arc connecting the endpoints with the diagram and with the bracket states equal to . This restricted version of the Turaev polynomial, so called the loop bracket polynomial, has the skein expansion of the usual bracket, but keeps track of the nesting of loops in the states that surround the long state component. The new variable , is taken as when there is a nest of loops surrounding the long state component in a given state. See Figure 4.
Definition 1**.**
[5*]** *The loop bracket polynomial is defined as follows.
[TABLE]
where is the writhe of , is the number of smoothing minus the number of smoothing applied at each crossing of to obtain the state , is the number of the circular state components that do not nest around the long state component and is the number of circular state components nesting around the long state component in the state .
The loop bracket polynomial is often a stronger invariant than the usual (normalized) bracket polynomial for planar knotoids. The normalized bracket polynomial of the knotoid given in Figure 5 is trivial but the loop bracket polynomial is nontrivial.
2.1.2. The arrow polynomials
In [8] the authors define the arrow polynomial for knotoids in by adapting the arrow polynomial of virtual knots [14]. The arrow polynomial is an oriented generalization of the bracket polynomial of knotoids, defined by assigning new variables to long state components in zig-zag form that are called irreducible state components. See Figure 6.
The readers are referred to [8] for the definition of the arrow polynomial. Here we note that there exists a chiral version of the arrow polynomial that takes account the chirality of the irreducible state components in . The irreducible state components shown in Figure 7 are mirror symmetric to each other, and are not isotopic to each other since the the cusps on them point to different local regions in the plane. In the chiral version of the arrow polynomial, the irreducible state components having zig-zags and are chiral to each other are assigned to different variables and .
For knotoids in we can also define a loop arrow polynomial. In the loop arrow polynomial, there are three types of variables corresponding to circular state components enclosing long state components. One type of variable is assigned to a long state component without any zig-zags surrounded by a number of circular state components. The other two types of variables are assigned to irreducible state components as shown in Figure 7 (with some number of positive or negative zig-zags) that are enclosed by circular state components.
2.1.3. A complexity invariant of knotoids:The height
The height of a knotoid diagram in [25] is the least number of crossings created through the underpass closure. The minimum of the heights of knotoid diagrams lying in the same knotoid class is called the height of the knotoid, and it is an invariant for knotoids in [25]. The height of a knotoid is an intrinsic invariant determining the type of a knotoid. Clearly, a knotoid in has height zero if and only if it is a knot-type knotoid. In [8] the authors show that the affine index polynomial and the arrow polynomial defined for knotoids in provide lower bound estimations for the height of a knotoid.
2.2. Basics on virtual knots
The theory of virtual knots was introduced by the second listed author [14, 15]. A virtual knot is an embedding of the unit circle in a thickened surface of arbitrary genus modulo isotopies and orientation preserving diffeomorphisms plus one-handle stabilization/destabilization of thickened surfaces. A virtual knot may be represented by different embeddings in different thickened surfaces. We call a representation of a virtual knot a minimal representation if it is an embedding of the knot that does not admit destabilization.
Theorem 1**.**
(Kuperberg)[20] A minimal representation of a virtual knot is unique up orientation preserving homeomorphisms.
Definition 2**.**
The virtual genus of a virtual knot is the genus of the surface of its minimal representation.
Classical knots (knots in or in ) can be considered as virtual knots of (virtual) genus [math]. From Kuperberg theorem it follows that classical knot theory properly embeds into virtual knot theory, that is, if two classical knots are virtually equivalent then they are also equivalent to each other by classical Reidemeister moves.
The theory of virtual knots has also a diagrammatic formulation: A virtual knot in a thickened surface of some genus can be represented by a virtual knot diagram in or in that contains a finite number of real/classical crossings,
and virtual crossings. A virtual crossing is indicated by a small circle placed around a crossing point as shown in Figure 8. The arcs containing a virtual crossing correspond to arcs of the virtual knot one of which lies at the front of a handle and the other lies at the back of the same handle of the thickened surface.
The moves on virtual knot diagrams are generated by the usual Reidemeister moves plus the detour move. The detour move allows a segment with consecutive sequence of virtual crossings to be excised and replaced by any other such a segment with a consecutive virtual crossings, as shown in Figure 9. Two virtual knot diagrams are virtually equivalent if they can be related to each other by a finite sequence of the Reidemeister and detour moves. A virtual knot is a virtual equivalence class of virtual knot diagrams.
Theorem 2 provides a one-to-one correspondence between the topological and the diagrammatic approaches of virtual knot theory. The transition between the two approaches is facilitated by abstract knot diagrams. An abstract knot diagram associated to a virtual knot diagram is a ribbon-neighborhood surface containing the knot diagram. The abstract knot diagram surface is an oriented surface with boundary. In Figure 10 we illustrate the abstract knot diagram associated with the virtual knot diagram given in Figure 8. For more details on abstract knot diagrams the reader is referred to [11, 2].
Theorem 2**.**
([14, 16, 2]) Two virtual knot diagrams are virtually equivalent if and only if their surface embeddings are equivalent up to isotopy in the thickened surfaces, diffeomorphisms of the surfaces, and addition/removal of empty handles.
Another approach to study virtual knot theory is via oriented Gauss diagrams [7]. An oriented Gauss diagram is an oriented circle with a number of chords each connecting a pair of points on the circle. Each pair of points connected by a chord corresponds to a real crossing and the chord encodes the information of real crossing with an orientation on it. The equivalence on Gauss diagrams is generated by the abstract Reidemeister moves that are analogues of Reidemeister moves on Gauss diagrams.
Theorem 3**.**
[7, 14]** Two virtual knot diagrams are virtually equivalent if and only if their corresponding Gauss diagrams are related to each other by abstract Reidemeister moves.
The notions of virtual knot theory including parity apply to knotoids naturally. Parity in virtual knot diagrams and related invariants are examined in [22, 23, 19]. Manturov studied [22] a parity projection map from virtual knots to classical knots. We discuss more on this map in Section 5.
3. Parity in knotoids
3.1. Gauss codes and the Gaussian parity
A Gauss code is a linear code that consists of a sequence of labels assigned to crossings of a knotoid diagram in
or in . It encodes crossings that are encountered during a trip along the knotoid diagram following the orientation. Since any crossing is traversed twice, each label in the code appears twice. This gives a code of length , where is the number of crossings. We keep the information of the passage through a crossing either as an overcrossing or an undercrossing by adding the symbols and , respectively, and the signs of the crossings by putting or next to the label. Clearly, each knotoid diagram has a unique Gauss code. See Figure 11 for an example.
A Gauss code of a knotoid diagram is said to be evenly intersticed if there is an even number of labels between two appearances of any label. Similarly for classical knots [14], it is shown in [8] that the Gauss code of a knotoid diagram in is evenly intersticed if and only if it is a knot-type knotoid diagram. Equivalently, the Gauss code of a proper knotoid diagram has a non-evenly intersticed Gauss code [8]. This fact gives rise to a well-defined parity map that is defined on the set of crossings in knotoid diagrams and takes values in . A crossing of a knotoid diagram is assigned parity and called odd if there are an odd number of labels in between the two appearances of the crossing, otherwise it is assigned to parity [math] and called an even crossing.
Using this parity of crossings, we define an invariant for knotoids called the odd writhe [8].
Definition 3**.**
Odd writhe of a knotoid diagram in , is the sum of the signs of the odd crossings,
,
where is the set of odd crossings in .
The knotoid represented by the knotoid diagram in Figure 11 has odd writhe equal to .
One proves that is invariant by observing that the crossing at an Reidemeister I move is always even, the two crossings at an Reidemeister II move are either both even or both odd, and at an Reidemeister III move either two crossings are odd or all three crossings are even. These properties of Gaussian parity are axiomatized by Manturov in [22] and form the basis for other parity invariants of virtual knots.
3.2. Parity bracket polynomial of knotoids
The parity bracket polynomial of V. Manturov [22] is a modification of the bracket polynomial that uses the parity of crossings in virtual knots. With the existence of even and odd crossings in knotoid diagrams, the parity bracket polynomial can be defined for knotoid diagrams.
For a knotoid diagram in or in , a parity state is defined to be a labeled graph that is obtained by first replacing each odd crossing of with a graphical node and then the remaining crossings are expanded by the bracket relation shown at the top of Figure 12 without any further check about odd or even. The resulting summation over crossing-free diagrams is identical to the state sum once the states are made irreducible by the reduction rule in the Figure 12.
The reduction rule is simply a type of Reidemeister II move that eliminates two graphical nodes forming the vertices of a bigon. Each state component that contains nodes after applying all possible reductions contributes to the polynomial as a graphical coefficient. Circular or long segment state components without any nodes left, contribute as the value of .
Definition 4**.**
The parity bracket polynomial of a knotoid diagram in or in , is defined as
,
where denotes the number of -smoothings minus the number of -smoothings, is the number of components without any nodes, and is the union of state components containing nodes in the state .
The normalized parity bracket polynomial of a knotoid diagram in or in is defined as
,
where is the writhe of . The normalized parity bracket polynomial is an invariant of planar and spherical knotoids [8].
It is shown [8] that the isotopy of and the reduction rule eliminate any bigon region. As a result, there is no graphical coefficient in the parity bracket polynomial of a knotoid in [8]. As we shall see below, this elimination does not neccessarily happen for knotoids in .
3.2.1. Parity bracket polynomial of planar knotoids
For planar knotoids, the parity states are then taken up to planar isotopy rather than isotopy of . This makes it possible for some graphical coefficients to survive. We give an example of two planar knotoids and in Figure 13 that are distinguished in this way. The knotoid is listed as the knotoid in the table [6] up to an orientation, and is the symmetric [25] of . Both crossings of the planar knotoids and are odd crossings. The planar isotopy classes of the resulting graphs and are the planar parity bracket invariants of and , respectively. We leave it as an (easy) exercise for the reader to verify that and are not planar isotopic and therefore and are not equivalent planar knotoids.
A further calculation shows that these pairs have the same loop bracket polynomial but are distinguished by the loop arrow polynomial discussed in Section 2.1.2 when given an orientation.
4. A connection between knotoids and virtual knots
The endpoints of a knotoid diagram in can be connected with an arc by encoding each intersection of the connecting arc
with a strand of the diagram as a virtual crossing, see Figure 15. The resulting diagram is clearly a virtual knot diagram that can be also represented in a torus. Precisely, two disks around the endpoints of are cut out from the -sphere of and a -handle is attached to the resulting annulus by identifying the boundaries via orientation reversing homeomorphisms. The attached handle is assumed to hold the arc connecting the endpoints of . The resulting torus representation of the knot, exemplified in Figure 16, is called the standard torus representation.
In this way we obtain a well-defined map [25, 8],
: {Knotoids in } {Virtual knots of virtual genus },
that is called the virtual closure map. Since the map is well-defined, any invariant of virtual knots induces an invariant for knotoids through the virtual closure map. The knotoid invariants obtained by the virtual closure map are stronger than the invariants obtained by classical closures of knotoids since adding virtual crossings does not change the knottedness information of the knotoid [8].
Clearly the virtual closure of a knot-type knotoid is a classical knot. It follows from Korablev and May [21] that the virtual closure will produce a genus [math] knot only if the knotoid is of knot-type, that is, only if the knotoid has height [math]. The representation of the virtual closure of a knotoid in a thickened torus is the same as Korablev and May’s ‘lifting’ of the knotoid. A knot in a thickened torus destabilizes if it can, in our terms, be represented in genus [math].
Theorem 4**.**
[21]** A knotoid has height [math] if and only if its lifting admits destabilization.
From Theorem 4 and the fact that knot-type knotoids (knotoids with height [math]) carry the same topological information as their closures (virtual or classical) we can conclude that there is no proper knotoid that closes virtually to the trivial knot and in fact, only the trivial knotoid closes virtually to the trivial knot.
It is not hard to show that the virtual closure map is not an injective map. The pair of knotoids given in Figure 17 has the same virtual closure. It can be easily verified that the knotoid on the left hand-side is -colorable but the knotoid on the right hand-side is mono-chromatic, so they are non-equivalent knotoids.
4.0.1. The virtual closure map is not surjective
We show that the virtual closure map is not surjective by examining the surface bracket states. Let be a fixed surface representation of the virtual knot . We apply Kauffman bracket state expansion by smoothing out all crossings of in and type. The resulting collection of disjoint simple closed curves in are the surface bracket states.
Definition 5**.**
[3*]** *The surface bracket polynomial of is defined as,
[TABLE]
where is the number of smoothings minus the number of smoothings, is the number of components of the state that bound a disk in , and is the formal sum of homology classes of components of the state that do not bound a disk.
Definition 6**.**
A surface bracket state has multiplicity one if it has only one component that does not bound a disk.
In Figure 18 we verify that each surface bracket state of the standard representation of the virtual closure of the knotoid given in Figure 18 has multiplicity one.
Lemma 1**.**
Given any standard torus representation of a virtual knot lying in the image of the virtual closure map. Each homologically nontrivial surface bracket state of such knot diagram in the torus has multiplicity one. In fact they can be only of the form , where are the longitudinal and the meridional generators of , respectively, and .
Proof.
In a standard representation of a virtual knot lying in the image of the virtual closure map, there is an arc attached to the ends of the knotoid that goes around the handle added to the -sphere minus two disks neighboring the endpoints. This is the closure arc. The endpoints of the knotoid are on the two boundary components of the annulus. In any surface state of the closure the two endpoints are connected by the long segment component. With the closure arc that goes around the attached handle, the long segment component forms a non-bounding component in the torus which is of the form , where . Furthermore, the long segment component cuts the annulus into two disks by the Jordan curve theorem. As a result all remaining components bound disks in the annulus and hence in the torus. ∎
Theorem 5**.**
Let be a virtual knot that lies in the image of the virtual closure map, and be any torus representation of . Then each homologically nontrivial surface bracket state of has multiplicity one.
Proof.
By Lemma 1, any surface bracket state of a standard representation of has multiplicity one. This property is true for any torus representation of the knot since has virtual genus one and minimal representations of are related to each other by an orientation preserving homeomorphism of the torus by the Kuperberg theorem. ∎
Corollary 1**.**
Let be a virtual knot of genus one and denote a torus representation of . As a corollary of Theorem 5, if at least one of the nontrivial surface state components of is of the form (for some choice of orientation) or for some , , that is, it is of some non-trivial multiplicity, then is not in the image of .
Now we can verify that the virtual knot with a torus representation given in Figure 19, is not the virtual closure of any knotoid in . We observe that the isotopy classes of the homologically non-trivial surface state curves are of the form (or homologous to) and , up to a choice of orientation, meaning that, they have non-trivial multiplicity. Therefore, by Theorem 5 we deduce that does not lie in the image of the virtual closure map.
Definition 7**.**
Let be a classical knot diagram. Virtualization of at a single (classical) crossing is defined to remove a -tangle containing a crossing and replace it with a virtual -tangle that contains the crossing switched and flanked with two virtual crossings. See Figure 20.
The resulting diagram is a virtual knot diagram that can be represented also in a torus [14]. Notice that the virtual knot diagram given in Figure 19 can be regarded as the virtualization of the trefoil at a single crossing.
The second listed author showed [14] that there is an infinite collection of virtual knots whose Jones polynomial are trivial. This collection is obtained by virtualizing a sequence of unknotting crossings. For some time it was an open problem in virtual knot theory where a virtual knot obtained in this way could be virtually equivalent to a classical knot. In the paper [9] it was shown, by using Khovanov homology for virtual knots, that no virtual knots obtained in this fashion are classical. Silver and Williams proved the following theorem for a specific class of virtualized knots by using a special feature of classical knot diagrams observed in the Wirtinger presentation of the knot group [24].
Theorem 6**.**
(Silver and Williams)[24] Let be a non-trivial classical knot diagram and is an unknotting crossing. If is the virtual knot obtained by virtualizing the crossing then is a non-classical and non-trivial virtual knot.
Theorem 5 applies to virtual knots of genus one obtained by virtualization at a single crossing.
Theorem 7**.**
Let be a non-trivial classical knot diagram and be a (classical) crossing on it. If the virtual knot obtained by virtualizing the crossing is a genus one virtual knot then does not lie in the image of .
Proof.
We analyze the surface state curves of the torus representation of depicted in Figure 21. We observe that homologically non-trivial state curves are only of the form and . That is, they all have non-trivial multiplicity. It follows from Theorem 5 that does not lie in the image of the virtual closure map. ∎
Corollary 2 follows from Theorem 6 and 7.
Corollary 2**.**
Let be a non-trivial classical knot diagram and be an unknotting crossing. If is the virtual knot obtained by virtualizing the crossing then is a virtual knot of genus that does not lie in the image of .
The discussion about the virtual closure map brings us to the following question: Is there a way to classify virtual knots of genus that are in the image of ?
Korablev and May give an answer to this question in [21] by using the geometric degree of knots in thickened surfaces.
Definition 8**.**
A knot in the thickened torus is said to have geometric degree one if there is a vertical annulus such that intersects at only one point.
They show that a virtual knot of genus one is in the image of the the virtual closure map (or according to their terminology the lifting map) if and only if it is a geometric degree one knot. Moreover, the virtual closure map is injective when it is restricted to set of all prime knotoids of height at least two [21].
Then the question we have asked is equivalent to the question: How do we detect knots in the thickened torus that have geometric degree one?. It would be interesting to explore invariants of knots in thickened surfaces detecting the geometric degree. Our approach with the surface bracket states to detect the image of the virtual closure map proposes a direct tool for recognizing virtual knots lying in the image of the virtual closure map. Here we conjecture the following.
Conjecture 1**.**
A virtual knot of genus one lies in the image of the virtual closure map if and only if all of the surface bracket states of any of its torus representations have multiplicity at most one.
5. Minimal diagrams of knot-type knotoids and the conjecture of Turaev
Turaev conjectures [25] that minimal crossing diagrams of a knot-type knotoid have zero height. We prove this conjecture by using the following theorems by Nikonov and Manturov [22] that are based on a parity projection map from virtual knots to classical knots. In the following statement means that is obtained by deleting some chords in the Gauss diagram of . This means that some classical crossings of are made virtual to obtain .
Theorem 8**.**
(Nikonov) There is a map from minimal genus virtual knot diagrams to classical knot diagrams such that for every knot we have and if two diagrams and are related by a Reidemeister move then their images , are related to each other by a Reidemeister move.
Theorem 9**.**
(Manturov) For every virtual knot diagram there exists a classical knot diagram , such that and admits the same Gauss diagram with if and only if is classical.
Corollary 3**.**
(Manturov) Let be a classical knot. Then the minimal number of classical crossings for virtual diagrams in the virtual equivalence class of is realized in classical diagrams (up to the detour move). For every non-classical diagram (that is, the genus of the associated abstract knot diagram surface is not zero) in the class of , the number of classical crossings is strictly greater than the minimal number of classical crossings.
Theorem 10**.**
Minimal diagrams of non-trivial knot-type knotoids have zero height.
Proof.
In the discussion, a minimal diagram refers to a diagram (in classical, knotoid and virtual categories) with minimal number of classical crossings.
Let be a knot-type knotoid and assume to the contrary that there is a minimal diagram of , that has a non-zero height. Let be the number of classical crossings of . Then the virtual closure of , is a virtual knot diagram with classical crossings and a number of virtual crossings that is at least equal to the height of .
Since is a knot-type knotoid, the virtual closure of , is a classical knot, and the virtual knot diagram lies in the virtual equivalence class of since the virtual closure map is a well-defined map on the set of knotoids in .
The genus of the closed connected orientable surface obtained by attaching -disks to the boundary components of the abstract knotoid diagram surface associated to can be found by the following formula [8]
,
where is the crossing number of and is the number of boundary components of the abstract knotoid diagram. The genus of is zero since has only classical crossings. That is, we have,
[TABLE]
It is clear that the number of boundary components of the associated abstract knotoid diagram is equal to the the number of planar regions determined by the diagram , and the boundary components that are adjacent to the endpoints of , are distinct since the endpoints of lie in different regions. For this reason, connecting the endpoints of virtually does not change the number of classical crossings but reduces the number of boundary components by . That is, the number of the boundary components of the abstract knot diagram associated to is equal to . It is known that the genus of the closed connected orientable surface obtained by attaching -disks to the boundary components of the abstract knot diagram surface associated with can be found by the following formula,
[TABLE]
From Equation 5.1 we have,
[TABLE]
Then by Theorem 8, any minimal diagram of has strictly less than classical crossings. Let be any minimal diagram of , and has classical crossings. We have,
[TABLE]
It is clear that the image of under the map (recall Section 2.1) is a knot-type knotoid diagram with crossings. Let us denote this knot-type knotoid diagram with . The underpass closures of the knotoid diagrams and are isotopic to the knot . This implies that the knotoid diagrams and are equivalent to each other since the underpass closure is a bijection map on the knot-type knotoids. We have assumed that is a minimal diagram of . Therefore we have,
[TABLE]
which contradicts with the above inequality. Therefore the assumption is wrong and the theorem follows. ∎
It is clear that the crossing number of a knot-type knotoid can be at most as the crossing number of the classical knot associated by the map . Turaev asked [25] whether the crossing numbers are actually equal. From Theorem 10 we can deduce the following.
Theorem 11**.**
The crossing number of a knot in is equal to the crossing number of the knot-type knotoid obtained from via the map .
Proof.
Theorem 10 implies that a minimal diagram of a knot-type knotoid can be obtained from a minimal diagram of the associated knot via the map .
∎
Acknowledgement. Kauffman’s work was supported by the Laboratory of Topology and Dynamics, Novosibirsk State University (contract no. 14.Y26.31.0025 with the Ministry of Education and Science of the Russian Federation).
The reference list from the paper itself. Each links out to its DOI / PubMed record.
- 1[1] A. Bartholomew. Andrew Bartholomew’s Mathematics Page: Knotoids, http://www.layer 8.co.uk/maths/knotoids/index.htm , January 14, 2015
- 2[2] J. Scott Carter, S. Kamada, M. Saito. Stable Equivalence of Knots and Virtual Knot Cobordisms,Knots 2000 Korea, Vol. 1 (Yongpyong). J. Knot Theory Ramifications , 11 , (2002), no. 3, 311-322
- 3[3] H.A. Dye, Louis H. Kauffman. Minimal Surface Representations of Virtual Knots and Links, Algebr. Geom. Topol. , 5 , (2009):509-535
- 4[4] D.Goundaroulis, J. Dorier, F. Benedetti, A. Stasiak. Studies of global and local entanglements of individual protein chains using the concept of knotoids. Sci. Reports , 2017 , 7 , 6309.
- 5[5] D. Goundaroulis, N. Gügümcü, S. Lambropoulou, J. Dorier, A. Stasiak, L.H. Kauffman. Topological models for open knotted protein chains using the concepts of knotoids and bonded knotoids. Polymers , Special issue on Knotted and Catenated Polymers, Dusan Racko and Andrzej Stasiak Eds. 2017 , 9(9) , 444, DOI;10.3390/polym 9090444.
- 6[6] D. Goundaroulis, J.Dorier, A.Stasiak. A systematic classification of knotoids on the plane and on the sphere. Ar Xiv link: https://arxiv.org/abs/1902.07277, 2019 .
- 7[7] M.Goussarov, M.Polyak, O.Viro. Finite type invariants of classical and virtual knots. Topology , 39,pp.1045-1068, (2000).
- 8[8] N. Gügümcü, Kauffman, L.H. New invariants of knotoids. European J. of Combinatorics 2017 , 65C , 186-229.
