Signed Heights of Knotoids
Abstract.
The height of a knotoid is a measure of how far it is from being a knot. Here we define the positive and negative parts of the height, and we prove that they determine the unsigned height. Some polynomial invariants provide lower bounds for the signed heights. We also study a set of sequences associated to a knotoid.
1. Introduction
The theory of knotoids, introduced by Turaev in [2], is an extension of classical knot theory. Knotoids have been studied recently in [3], [4], [5], and [7], and they have also been used for studying proteins.
1.1. Knotoids and Sign Sequences
A knotoid diagram is an immersion of an interval into with only transverse double crossings, together with over/under crossing information. A knotoid is a class of knotoid diagrams up to planar isotopy and the Reidemeister moves performed away from the endpoints. (We will provide a geometric definition as well, in Section 2.6.) Knotoids are always considered to be oriented, that is, the endpoints are labelled as the tail and the head .
A shortcut for a knotoid diagram is an embedded path from to that intersects transversely and does not intersect the crossings. Of course, every knotoid diagram has many shortcuts. The intersections between and a shortcut are signed; see Figure 1. (The endpoints are not considered to be intersections.)

A pair , where is a shortcut for , will be called a shortcut diagram. We can connect any two shortcut diagrams for a knotoid by planar isotopy, the Reidemeister moves away from the shortcut, and the three shortcut moves shown in Figure 2.


For each diagram and shortcut , the height of the pair is the number of intersection points with . A sign sequence is a finite sequence with values in , and for a shortcut diagram we define to be the sign sequence of length expressing the signs of the intersections between and in the order they appear when following from to . The positive (resp. negative) height is the number of appearances of (resp. ) in .
These values give rise to natural invariants of knotoids:
Definition 1.1.
For a knotoid , the height of is the minimum of the heights over all shortcut diagrams representing . (This is the complexity in [2].) We define the signed heights similarly.
Definition 1.2.
A sign sequence is attainable for if it is for some shortcut diagram representing . We will care in particular about the minimal attainable sequences, that is, those realizing the height.
Remark.
There are several related theories not considered in this paper. In particular, knotoids on , virtual knotoids, and multi-knotoids are interesting generalizations.
1.2. Main Results
There is a simple relationship between the height of a knotoid and its signed heights.
Theorem 1.3.
For all , .
1.3 reduces questions about the height of a knotoid to questions about its signed heights, which form a height pair . This will make it easier to compute the heights of some knotoids. The theorem also implies that all minimal attainable sequences for a knotoid are rearrangements of each other. The next theorem provides another restriction on the set of minimal attainable sequences.
For a sign sequence , a left shift move of size on is the result of deleting appearances of as a consecutive subsequence and then inserting copies of . Similarly, a right shift move deletes copies and adds copies of . The deletions and insertions all happen at the same time. For example, a nontrivial shift move on must be a left shift of size , deleting the second and third entries. The possible results after inserting are , , and .
Theorem 1.4.
If and are two minimal attainable sequences for , there is a sequence of minimal attainable sequences
such that each differs from by a shift move.
The signed heights of a knotoid can be bounded by some polynomial invariants, in particular the Turaev polynomial of [2] and the index polynomial of [5]. For a nonzero Laurent polynomial , we will write for and for . We also set . For a Laurent polynomial in multiple variables, the signed degree in a specific variable will be denoted by (for example) .
Theorem 1.5.
For a knotoid , .
Theorem 1.6.
For a knotoid , .
The index polynomial also gives more specific information about attainable sign sequences.
Theorem 1.7.
Any attainable sequence for must have a consecutive subsequence adding up to , and a consecutive subsequence adding up to .
In the theorem above, of course, we treat terms as and as .
Theorem 1.8.
If is a knotoid such that the bounds in 1.5 are equalities, then has a unique minimal attainable sign sequence.
1.3. Organization
In Section 2, we give background information on knotoids, including basic operations and the relationship between knotoids and theta-curves. In Section 3, we prove 1.3 and 1.4. Section 4 addresses the behavior of height and sign sequences under knotoid operations. In Section 5, we recall background on -writhes and the Turaev polynomial, and we prove Theorems 1.5 through 1.8. Section 6 contains interesting examples and applications to knotoids of low height.
1.4. Acknowledgements
I would like to thank my advisor, Ian Agol, for his thorough and careful feedback. I am also grateful to Kyle Miller for our very helpful conversations.
2. Background on Knotoids and Theta-Curves
2.1. Closures and Knot-Type Knotoids
The first examples of knotoid invariants are the over- and underpass closures. A shortcut diagram for gives rise to an oriented knot diagram by incorporating the shortcut into the diagram to create an immersion of a circle into . By taking the shortcut to pass over (resp. under) the knotoid at each crossing, we obtain a diagram of the overpass (resp. underpass) closure of , denoted (resp. ).
Conversely, given a diagram of an oriented knot , and a point on an edge of the diagram, we may obtain a knotoid diagram by deleting an open interval around the chosen point. The resulting knotoid depends only on and is denoted . By construction, has height and . Any knotoid of height may be obtained in this way, and so we have a natural identification of the set of height- knotoids with oriented knots. Such knotoids are called knot-type. Knotoids that are not knot-type are proper.
2.2. Multiplication
The set of knotoid types has a natural noncommutative product. Given knotoid diagrams and , we may form a diagram by deleting small open disks around the head of and tail of , then gluing appropriately along the boundaries. The resulting knotoid depends only on the knotoids represented by and . It also makes sense to refer to the product of two shortcut diagrams as another shortcut diagram.
Knotoid multiplication is associative. The trivial knotoid, the one that can be drawn without crossings, is an identity. The over/underpass closure operations and the operation are monoid homomorphisms.
A prime knotoid is one that cannot be written as a nontrivial product. Every knotoid has a unique decomposition of the form
where each is a proper prime knotoid. A knot-type knotoid is prime if and only if the corresponding knot is prime. Two distinct prime knotoids commute if and only if one or both is knot-type ([2]).
2.3. Basic Involutions
For a knotoid , the reverse is obtained by switching the orientation on a diagram of , that is, swapping the labels of the vertices. The mirror image is obtained from switching the over/under information on each crossing, and the symmetry operation acts by reversing the orientation of the ambient . Rotation is the composition of symmetry and mirror image reflection. See Figure 4. The basic involutions generate a group isomorphic to .

2.4. Lifting
Given a diagram of some knotoid and positive , we may choose a lift of to the -fold cover of branched over and . The result is a new diagram with orientation and over/under information inherited from , and is a well-defined knotoid. See Figure 5. For all , the sequence stabilizes to a knot-type knotoid; we define to be the corresponding knot.

A similar construction is studied in [4]: The entire preimage of under the double cover of branched over the endpoints constitutes a diagram of an unoriented knot. The unoriented knot is an invariant and is called the double branched cover of .
2.5. Framings
A framing of a knotoid is a class of diagrams of up to regular isotopy, that is, up to Reidemeister moves I’, II, and III. Two diagrams of are in the same framing class if and only if they have the same writhe.
Similarly, a shortcut framing for is a class of shortcut diagrams related by all moves except the Type I shortcut move. Shortcut framings are classified by algebraic intersection number between the main strand and the shortcut .

2.6. Simple Theta-Curves
The theta graph is the graph with two vertices, and , and three oriented edges , , and from to . A theta-curve is an embedding of into . Such a curve is simple if (the image of) is unknotted. A spanning disk for a simple theta-curve is a choice of embedded disk with boundary such that intersects transversely.
Like knotoids, isotopy classes of simple theta-curves form a monoid: The product of and is formed by deleting small balls around in and in , and gluing the boundaries so that each edge of is glued to the edge of with the same label. The resulting theta-curve is well-defined up to isotopy, because the pure mapping class group of a thrice-punctured sphere is trivial. Similarly, we may multiply isotopy classes of pairs .
The height of is the minimal number of intersections of a spanning disk with , and the positive and negative heights are the minimal numbers of intersections of those signs. The sign sequence associated to is the sequence of signs of the intersections of with , in the order along from to . Sequences obtained this way are attainable for .

There is a natural map from the set of knotoids to the set of isotopy classes of simple theta-curves. Given a shortcut diagram , for a knotoid , we may form a simple theta-curve by considering the diagram as lying in a neighborhood of , with lifting to an embedded path , and adding edges and over and under . The resulting theta-curve represents . Note that, in , the isotopy class of is .
Theorem 2.1 (Turaev [2]).
The map is a monoid isomorphism.
The construction above also yields a correspondence between shortcut diagrams for and spanning disks for : For each such diagram , we may choose to be the “vertical” disk between and in the constructed theta-curve . Under this construction, the sign sequence of is the same as that of . Every isotopy class of spanned embeddings for may be obtained in this way from a shortcut diagram for . Thus, heights and attainable sign sequences for correspond directly with heights and attainable sequences for . Isotopy classes of spanned embeddings for correspond to classes of shortcut diagrams of under planar isotopy, the Reidemeister moves away from , and the Type III shortcut move.
3. Comparing Attainable Sequences
Here we prove Theorems 1.3 and 1.4. But first, we establish that allowing certain self-intersections in spanning disks would not reduce the height of a simple theta-curve.
Lemma 3.1.
Suppose, for some simple theta-curve , that is an immersed (not necessarily embedded) disk such that (a) , (b) intersects transversely, and (c) the self-intersections of under are disjoint circles identified transversely in pairs. Then has at least intersections with .
Proof.
There is some finite number of intersecting pairs of circles on . Any circle of self-intersection has a neighborhood in which looks like the product of a plus sign with a circle. There are two ways of resolving the intersection by smoothing. The resolution that preserves the number of components creates a new immersion of a disk. Note that this resolution might not respect orientation. Replacing by this new immersion, we have reduced the number of self-intersections without changing the number of intersections with . Proceeding in this fashion shows that there is a spanning disk with the same number of intersections as . ∎
We will say that two spanning disks and for a theta-curve are compatible if their interiors are disjoint. Compatible pairs of spanning disks are useful because of the following lemma.
Lemma 3.2.
If and are compatible spanning disks for a simple theta-curve and , then .
Proof.
Because and are compatible, is an embedded sphere dividing into two balls. Note that is not naturally oriented, because the orientations of and agree on . Let denote the oriented sphere .
The net number of intersections of with , not including or , must be , , or . In symbols,
(1) |
(Here we have suppressed in the notation.)
The next fact provides opportunities to apply 3.2.
Lemma 3.3.
If and are spanning disks for a simple theta-curve and realizes the height of , then there is a sequence of spanning disks
such that consecutive disks are compatible and the sequence is nonincreasing.
Proof.
We may choose such that is isotopic to and such that and intersect transversely away from . Then the intersections consist of and a system of disjoint circles and arcs embedded properly in both and . We may also require in our choice of that none of the intersection curves meet . For each , once we have chosen we will form in such a way that has fewer total components of intersection with than does . Let be the system of intersections between and , not including .
Case 1: is empty.
If is empty, then is compatible with , so we set and . Because realizes the height of , .
Case 2: has an arc, but no circles.
If contains an arc, but no circles, we can find an innermost such arc on . By innermost arc, we mean one for which all other arcs lie on one side of in . In particular, the endpoints of divide into two segments and such that the endpoints of all other curves of lie on . Let be the disk in bounded by , and the disk in bounded by . Since contains no endpoints of the arcs in , is also innermost in . In particular, .
Since is an embedded disk with boundary , its height is at least . Therefore, has at least as many intersections with as does . Now let be the result of slightly perturbing to be compatible with . Then has fewer intersection curves than with , and .
Case 3: contains a circle.
If there is at least one circle, there is an innermost circle in . Then bounds a disk with . Let denote the disk in bounded by . In contrast with Case 2, is not necessarily innermost in , so may be more than just .
By 3.1, has at least as many intersections with as with , so it intersects at least as many times as . Therefore, we may proceed as in Case 2. Let , and perturb it so that it is compatible with . Then , and we have reduced the number of intersection curves with .
This covers all the cases, so we are done. ∎
Lemma 3.4.
If and are spanning disks for a simple theta-curve and realizes the height of , then there is a sequence of spanning disks
such that consecutive disks are compatible and the sequences are both nonincreasing.
Proof of 1.3.
Given a simple theta-curve , a spanning disk realizing the height, and any other spanning disk , 3.4 implies that has no greater positive or negative height than . Therefore, realizes the signed heights, and so,
For a knotoid , we obtain by setting . ∎
To prove 1.4, we will use another lemma about compatible spanning disks.
Lemma 3.5.
If and are compatible spanning disks for a simple theta-curve and , then and differ by a shift move.
Proof.
Let be the sphere as in the proof of 3.2. Let be the ball in such that is the oriented boundary of , and assume that “starts” outside of . In the overall sequence of intersections of with (not including the endpoints), the signs of the intersections alternate: The odd- and even-index intersections are negative and positive, respectively. Because , the total number of intersections is even. Each odd-even pair of consecutive intersections has type , , , or . Therefore, is obtained from by a left shift move.
If instead starts in the inside of , then is obtained from by a right shift move. ∎
Proof of 1.4.
For a simple theta-curve , suppose and are both spanning disks realizing the height of . Then in the sequence of spanning disks obtained from 3.4, each realizes the height of . Therefore, applying 3.5 to the sequence implies that and are connected among minimal attainable sequences by shift moves. ∎
4. Knotoid Operations and Attainable Sequences
4.1. Signed Heights under the Basic Involutions
The signed heights of knotoids behave in straightforward ways under the basic knotoid involutions.
Proposition 4.1.
For all , we have
More specifically, we can say the following.
Proposition 4.2.
If is an attainable sign sequence for , then,
-
(1)
is attainable for ,
-
(2)
is attainable for ,
-
(3)
is attainable for , and
-
(4)
is attainable for .
where is the result of switching all terms in and is the result of reversing the order.
Proof.
Given a shortcut diagram for , the signs of the crossings between and are not changed by switching the over/under information of or by simultaneously switching the orientations of and (recall that the orientation for a shortcut is determined by the rest of the diagram). However, changing the orientation on changes the signs of the intersections. ∎
4.1, together with 1.3, has implications for unsigned heights of knotoids, such as for rotatable knotoids, which are addressed in [4]. A knotoid is rotatable if it equals .
Corollary 4.3.
Every rotatable knotoid has even height.
4.2. Multiplication and Concatenation
In this section we relate the set of attainable sign sequences for a product to the attainable sequences of its factors.
Proposition 4.4.
For any and , if is an attainable sign sequence for and is attainable for , then the concatenation is attainable for .
Proof.
Given shortcut diagrams for and , the sign sequence for the product of the diagrams is the concatenation of the sign sequences for the two original diagrams. ∎
Note that as a particular case of the statement above, if is any attainable sequence for a knotoid , then the result of appending or to either end of is also attainable for , because on any shortcut diagram for we can perform a Type I shortcut move around either endpoint.
The next theorem is a converse for 4.4.
Theorem 4.5.
Any minimal attainable sequence for is the concatenation of minimal attainable sequences for and .
We will prove 4.5 using a modification of original argument appearing in [2] for 4.7 below, which is an immediate corollary.
Corollary 4.6.
For two knotoids and , .
Corollary 4.7 (Turaev [2]).
For two knotoids and , .
We will treat knotoids as simple theta-curves, and use the following lemmas:
Lemma 4.8.
Suppose that is a simple theta-curve and is a compact oriented surface (not necessarily connected) embedded in such that (a) , (b) intersects transversely, and (c) The component of with boundary is a disk. Then the sequence of signs of intersections of with is attainable for .
Proof.
Let be the disk component of .
Case 1: Every closed component of is a sphere.
If , then of course is attainable.
If is not connected, some spherical component of must be “outermost” in the sense that no other sphere separates it from . If is on the positive side of , then we may choose an embedded path from to the positive side of such that the path does not otherwise intersect or . Then we can incorporate into in an orientation-respecting way by adding an annulus to connect to and deleting disks in and around the path’s endpoints. If is on the negative side of , we do the same but with the negative side of . Doing this several times replaces with a spanning disk and realizes the sign sequence as attainable.
Case 2: General Case.
Each closed component of separates , and as in Case we can consider to be “outside” of every other component, regardless of their orientations. Call a spherical component of trivial if it intersects twice and is unknotted inside the sphere. Let be the set of closed components that are not trivial spheres. If is nonempty, consider an innermost element of . Inside of are some number of segments of . Some of these segments may have trivial spheres attached. Let us delete and replace it with several trivial spheres: One sphere is added for each segment of inside , surrounding the segment and all preexisting trivial spheres on that segment. The new spheres may be oriented appropriately so that we have not changed . Repeating this process renders empty and reduces us to Case 1. ∎
Lemma 4.9.
For any simple theta-curve and knot-type theta-curve , a sign sequence is attainable for if and only if it is attainable for .
Proof.
It is immediate that any attainable sequence for is attainable for .
For the other direction, suppose we have a spanning disk for . Pick a ball such that (a) intersects only on , (b) intersects transversely, and (c) the restriction of to is in the form of a -tangle. If intersects inside , we may push these intersections to the outside: Choose a subinterval of containing the intersections with as well as one of the two endpoints, then delete from a regular neighborhood of that interval. Therefore we may choose so that is empty.
Let and be the intersections of with , assigned such that is oriented from to . Each component of is a genus- surface (with boundary) properly embedded in , and each component of is an oriented circle with winding number , , or around . Suppose there is at least one circle with winding number . Then there is an innermost such circle. We may cut along this circle and fill in two disks on either side of to obtain a new spanning surface consisting of a disk and a sphere. Doing these repeatedly, we obtain a surface as in 4.8 (specifically, as in Case 1) such that and and such that every component of has winding number . There may now be some spherical components of contained entirely within , but they do not intersect .
Now, let us label the components of as . Each separates into two regions, and each is disjoint from the others and from . The components of , all concentric circles, have an order based on how they are arranged from to and so can be indexed . For each , let be the winding number of the th circle and let be the index of its component in . For each , the sum of the over all with must be , because does not intersect . For similar reasons, for all and all and with and , the sum of the over all with and is also .
Now, to show that is attainable for , we will create a spanning of by deleting and replacing the interior of . Let be a standard -ball, and choose an orientation-respecting identification . Let be an unknotted strand properly embedded in from to . Now consider a partition of the components of into pairs such that (a) paired components have opposite winding numbers, (b) paired components come from the same component of , and (c) for , we do not have paired to and to . (A simple induction argument shows this is possible.) Now, we connect each pair of components with an unknotted annulus disjoint from and disjoint from the other annuli. See Figure 8.

Now we glue along to the closure of the complement of to obtain a spanning surface for , with . Because we replaced each component of with several annuli, we have not created any higher-genus components by replacing with . Therefore is a union of a disk with spheres, and so by 4.8, is attainable for . ∎
Proof of 4.5.
Given a spanning disk for a product realizing its height, we wish for there to be an embedded sphere decomposing as a product of spannings of and . Such a sphere does not exist in general, but we will assume that and have no knot-type factors, and this will be sufficient by 4.9.
By construction, there is a sphere decomposing as a product of and . Necessarily, the two vertices of lie on opposite sides of , and each edge intersects once transversely. We may assume to intersect transversely as well. Then the intersection of and consists of a line segment and possibly several circles. If the number of circles is , then cuts into two disks, which are spanning disks for and , so we are done.
If there are some circles, we may pick one which is innermost in . This bounds a disk in which does not otherwise intersect or . It also separates into two disks and . Since sits on one side of and cuts that side into two parts, one part contains a vertex and the other does not. We may assign the labels and in such a way that is a sphere that separates the vertices of and is a sphere with both vertices on one side. Let denote the ball with boundary that doesn’t contain the vertices.
Each of and must have its one intersection with on , as it cannot intersect . The intersection of with may be on either or , but regardless, cannot intersect more times than it intersects , by 3.1. Therefore, either intersects once and not or , or it intersects and once each but not . In the latter case, there is a -tangle inside of , but by our assumption of no knot-type factors, the tangle is unknotted.
Let be the sphere formed by pushing through and past , so is a slight perturbation of and there are fewer circular intersections of with than with . Since either does not intersect or contains only an unknotted segment between and , is isotopic to , so still decomposes as .
Repeating the above steps yields a sphere intersecting once and in only an interval, so it decomposes as a product of and as desired. Then is the concatenation of with . Since is minimal, each is also minimal. ∎
4.3. Signed Heights under Lifting
For a shortcut diagram of a knotoid , there are lifts of to a shortcut for . The total number of positive/negative intersections of with all such lifts is equal to . Of course, that amount must be at least times the minimal number of positive/negative intersections with each of the lifts of .
Proposition 4.10.
For all and , .
Furthermore, we can obtain attainable sign sequences for from attainable sequences for in the following way. Given a sign sequence of length , for each let be the sum of the terms of from indices to . For , let be the maximum of and . Then for , let be the subsequence of consisting of only the terms from indices with . Given , we may label the lifts of as in such a way that they increment counterclockwise around the lift of , and the initial direction of is between and . Then the th intersection of with lifts to an intersection of with , so for each , . This implies the following.
Proposition 4.11.
For every attainable sequence for , each is attainable for .
5. Bounds on Signed Height
5.1. Writhes
Given a crossing in a knotoid diagram , there is a unique resolution of that respects orientation. This resolution creates an oriented diagram with two components, a loop and an interval with the same endpoints as . The winding number of around the twice-punctured sphere is called the intersection index of , denoted . The index is equal to the intersection number of with any shortcut, or with . Note that the index of a crossing doesn’t depend on any over/under information. If a crossing has index , it will be called an -crossing.
Definition 5.1.
For nonzero , the -writhe of is half the sum of the signs of the -crossings.
Theorem 5.2 (Kim–Im–Lee [5]).
For nonzero , the -writhe is a knotoid invariant.
Remark.
Our convention differs from [5] by a factor of ; they omit the word “half” in 5.1. Under our convention, the -writhe is still an integer: Any knotoid diagram can be turned into a diagram for the trivial knotoid by switching the signs of crossings such that each “late” strand passes over each “early” strand. Each such switch changes the -writhe by an integer, and the -writhe of the trivial knotoid is , so all -writhes of all knotoids are integers. However, what we say here does not apply in general to virtual knotoids, which are considered in [5] alongside classical knotoids.
The following are immediate consequences of the definition of -writhe:
Proposition 5.3.
For a knotoid , we have the following:
-
(1)
-
(2)
-
(3)
-
(4)
Proposition 5.4.
For knotoids and , .
The -writhes of a knotoid can be encoded in the coefficients of a polynomial. The index polynomial for is
This is closely related to its similarly-named predecessor, the affine index polynomial of [3], defined by
where is , and is as shown in Figure 9. Note that differs from only by sign. The affine index polynomial satisfies for all ([3]), so it is related to the index polynomial by the formula
(3) |
The coefficient of the affine index polynomial of equals the natural linking number of consecutive components in a periodic diagram for (see Figure 5).

The degree of the affine index polynomial was shown to be a lower bound for the height of a knotoid in [3]. Because of the relationship in eq. 3, this is equivalent to Proposition 3.12 of [5]. 1.5, together with 1.3, is an improvement on this bound in the case that and are both positive.
Proof of 1.7.
For nonzero , if , any shortcut diagram for must have an -crossing . Then the segment of starting and ending at has, algebraically, intersections with the shortcut , so the signs in the corresponding segment of add up to . ∎
Proof of 1.5.
If , then as above, in any attainable sign sequence for there is a consecutive subsequence with sum . Therefore, for positive there must be at least appearances of , and for negative there are at least appearances of . This proves that the positive/negative height of is bounded below by the positive/negative degree of . ∎
Proof of 1.8.
Suppose that . A minimal attainable sign sequence contains copies of and copies of , and by 1.7, the terms of the same sign must all be consecutive. Therefore, any minimal attainable sign sequence is one of or . Call these two sequences and , respectively. To show that only one of these can be attainable, we consider several cases.
Case 1: or is .
If one of the signed heights is zero, then all of the terms are the same sign, and .
Case 2: .
In this case, and are not related by a shift move. There are no other minimal attainable sequences, so by 1.4, they cannot both be attainable.
Case 3: or is and neither is .
Supposing that and are both attainable, they are the only minimal attainable sequences. By 3.4, there are compatible spanning disks and for such that for .
Since is an embedded sphere in and is an embedded circle in , we may pick an embedded sphere such that intersects at and only, and such that and each intersect in an interval. Then we may slide down onto and obtain a diagram for with two compatible shortcuts and corresponding respectively to and (see Figure 10). We have a region in bounded by such that there are segments of in , one entering and leaving by , one entering and leaving by , and the rest crossing from one side to the other. Without loss of generality, we may assume that, starting from , intersects before . Then must be , and the intersections come in the order
where the “” consists of consecutive copies of . Since any crossing of lies either in or the complement of , the loop on from to has an even total number of intersections with and . Therefore, if that loop includes the negative intersection with , it also includes at least one positive intersection, so if we measure the index of by intersections of the loop with , the index is nonnegative.

Since all crossings have nonnegative index, all negative writhes are , contradicting the assumption that . This proves 1.8. ∎
5.2. The Turaev Polynomial
A state of a diagram is a function from the set of crossings to . For each state , the -smoothing of is given by smoothing each crossing according to Figure 11. The sum of over all crossings is denoted , and the number of embedded circles in the diagram after smoothing by is . (There is also one embedded interval, which is not counted.) The bracket polynomial of is then
The bracket polynomial is invariant under Reidemeister moves I’, II, and III, so it is a framed knotoid invariant. A Reidemeister I move changes the bracket polynomial by a factor of , so the normalized bracket polynomial defined by
in [2] is an unframed invariant.

There is also a two-variable version of the bracket polynomial, called the extended bracket polynomial in [2] or the Turaev polynomial as in [8]. For a shortcut diagram , let denote the algebraic height
and for any state, let be the algebraic height of the interval component of the -smoothing of , with its natural orientation. Then the Turaev polynomial of is
This is an invariant of knotoids with both a framing and shortcut framing. The normalized version
is a knotoid invariant and always takes values in .
The height of a knotoid satisfies ([2]). 1.6 does not improve this bound on the overall height but is the equivalent statement for the signed heights.
Proof of 1.6.
Fix a shortcut diagram representing a knotoid . For any state , the -smoothing of only has as many intersections with as does. In particular, the interval component of the smoothing has no more than
positive or negative intersections with , so we have
Therefore, the exponents of are no more than and no less than . ∎
A categorification of the Turaev polynomial, the triply-graded winding homology, is defined in [8]. The corresponding Poincaré polynomial is denoted and satisfies
for every . The winding homology is the homology of a chain complex in which each generator is given a -grading for some state , so in addition to 1.6 we may also say that
6. Knotoids with Low Height
6.1. Knotoids of Height One
3.4 allows us to characterize knotoids of height using tangles. Let be the unit ball in with labelled points , , , and . Suppose we are given a -tangle in with a strand connecting to , and a strand connecting to . Then we may form a knotoid as in Figure 12. This knotoid has and . Let be the set of (isotopy classes of) such tangles such that (a) no ball inside contains a nontrivial -tangle and (b) is not the trivial tangle formed by two straight line segments.

A knotoid of height is prime if and only if it has no knot-type factor. Height- knotoids each have height pair or , and the two types are in bijective correspondence via rotation. Let be the set of prime knotoids with height pair .
Theorem 6.1.
The map is a bijection .
Proof.
For any , there is a spanning disk for such that and such that can be recovered by deleting a regular neighborhood of and using the appropriate identification . Suppose is another spanning disk for such that and are compatible and also has sign sequence . Then on one side of the sphere is a -tangle that, by condition (a) of the definition of , is unknotted. Therefore, is isotopic to .
Suppose has height (and therefore is not in ). Then by 3.4 and the previous paragraph, there is a -height spanning disk compatible with . Then splits into two -tangles, which must both be trivial, contradicting condition (b) of the definition of . Therefore, has height . For all , no ball intersecting may contain a nontrivial -tangle, and so is in .
Knowing that has height , 3.4 now implies that no other has , so the map is injective.
For any knotoid , we may obtain a with by finding a spanning disk for with height and deleting a regular neighborhood of . Since is prime and has height , satisfies conditions (a) and (b). ∎
6.2. Knotoids of Height Two
Consider the following two examples of knotoids with height .
Example 6.2.
The Kinoshita knotoid , shown in Figure 13, is notable for being a nontrivial knotoid with trivial overpass and underpass closures. The diagram shown has a shortcut with sign sequence , and satisfies . Therefore, , and by 1.8, is the only minimal attainable sign sequence for .
The Kinoshita knotoid satisfies . Note that neither the index polynomial nor the Turaev polynomial distinguishes from . However, by 4.2, the only minimal attainable sequence for is , so is not rotatable.

Example 6.3.
Let be the knotoid shown in Figure 14. The periodic diagram shown has shortcuts realizing and as attainable sign sequences. The index polynomial is , showing that . A lower bound of for is provided by the Turaev polynomial: the coefficient is . Therefore, and are both minimal.
The information above gives us an easy way of showing that is prime: Since is trivial, has no knot-type factor, so to be composite it would have to be a product of two proper knotoids. One would have to have height pair , and the other , but then by 4.5, only one of or would be attainable for .

In general, a knotoid of height falls into one of five categories based on whether its set of minimal attainable sequences is , , , , or . We will further divide the last category into two subcategories.
By 3.4, if is a knotoid of height and both and are attainable sequences, then there are compatible spanning disks and respectively realizing those two sequences as attainable for .
Theorem 6.4.
Suppose is a knotoid as above. Then exactly one of the following is true.
-
(a)
The disks and can be chosen in such a way that both of the intersections of with come before the intersections with .
-
(b)
The disks and can be chosen in such a way that both of the intersections of with come before the intersections with .
To prove 6.4, we will use a particular notion of splitting for -tangles, analogous to splitting of links: Suppose be a ball with four labelled points , , , and on , and is a fixed choice of isotopy class of circles on separating and on one side from and on the other. A circle in will be called a splitting circle. Then a -tangle in will be called split with respect to if there is a properly embedded disk (a splitting disk), disjoint from the strands of tangle, whose boundary is a splitting circle.
Lemma 6.5.
Suppose is a -tangle formed from two other tangles and in the way shown in Figure 15. Take and to be the classes of on and , respectively. Then is split if and only if is split.

Proof.
Of course, if is split then is split. Conversely, suppose we have a splitting disk for . Choose in such a way that is in general position and is disjoint from . The intersection must separate the strands of from each other. If any components of bound disks in the punctured surface , those components can be removed by cutting and capping. Also, no component of may separate the point of from the point of in , because the circle must be nullhomotopic in . Then there must be an odd number of remaining components of , and they must all be separating circles for . An innermost such circle in would bound a splitting disk for . ∎
For a simple theta-curve and spanning disk with , deleting a regular neighborhood of creates a -tangle of the pattern shown in Figure 16. This -tangle is well-defined up to simultaneous braiding on the left and right, and the strands can be labelled as the first, second, and third strands based on the order they appear on . Let be the -tangle formed by deleting the first strand, and the -tangle formed by deleting the third. We will call (a)-split if is nonsplit and is split, where splitting is indicated by the jagged line. Conversely, will be called (b)-split if is split and is nonsplit. For spanning disks with sequence , we can form and in a similar way, but we use the opposite convention for (a)- and (b)-splitting: is (a)-split if is split and is nonsplit.
Note that (a)- and (b)-splitting only apply to pairs with , and no disk may be both (a)-split and (b)-split.

Lemma 6.6.
If is a knotoid such that condition (a) from 6.4 is true, then every minimal spanning disk for is (a)-split. If instead (b) is true, every minimal spanning disk is (b)-split.
Proof.
Suppose that (a) is true of . Then may be drawn as in Figure 17, and the tangle must be nonsplit, as otherwise would have height . The -tangles corresponding to and are each formed by adding one copy of with one copy of in the appropriate order. By 6.5, and are both (a)-split. Furthermore, by another application of 6.5, if and are any two compatible spanning disks such that one is (a)-split, then the other is (a)-split as well. Then 3.4 implies that all minimal spanning disks are (a)-split.

The same reasoning shows that if (b) is true of , then all minimal spanning disks of are (b)-split. ∎
Proof of 6.4.
First we show that (a) or (b) is true. Suppose we have any choice of and . By the same reasoning as in the proof of 3.5, a positive intersection of with must be followed by a negative intersection or positive intersection, and a negative intersection must be followed by a positive intersection or negative intersection. Therefore, the overall sequence of intersections is either or .
That (a) and (b) cannot both be true follows from 6.6. ∎
Example 6.7.
Consider the knotoid shown in Figure 18. The index polynomial is , but the Turaev polynomial tells us that the positive and negative heights are both . The spanning disk corresponding to the marked shortcut is neither (a)-split nor (b)-split, because the corresponding tangles and are both split. Therefore, is neither type (a) nor type (b), so is its only minimal attainable sequence.

We now have a partition of the set of height- knotoids into six categories: Type (a), type (b), and four categories for knotoids that each have only one minimal attainable sequence. For any knotoid with height , the rotation is in a different category from . Together with 4.3, this implies the following corollary.
Corollary 6.8.
No proper knotoid with height below is rotatable.
The author does not know if any proper rotatable knotoids exist. In [4] it is shown that a knotoid cannot be rotatable if its double branched cover (see Section 2.4) is hyperbolic.
References
- [1] Shin’ichi Kinoshita “On Elementary Ideals of Polyhedra in the 3-Sphere” In Pacific Journal of Mathematics 42.1, 1972, pp. 89–98
- [2] Vladimir Turaev “Knotoids” In Osaka Journal of Mathematics 49, 2012, pp. 195–223
- [3] Neslihan Gügümcü and Louis Kauffman “New Invariants of Knotoids” In European Journal of Combinatorics 65, 2017, pp. 186–229
- [4] Agnese Barbensi, Dorothy Buck, Heather Harrington and Marc Lackenby “Double Branched Covers of Knotoids”, 2018 URL: https://arxiv.org/abs/1811.09121
- [5] Sera Kim, Young Ho Im and Sunho Lee “A Family of Polynomial Invariants for Knotoids” In Journal of Knot Theory and Its Ramifications 27.11, 2018
- [6] Dimos Goundaroulis, Julien Dorier and Andrzej Stasiak “A Systematic Classification of Knotoids on the Plane and on the Sphere”, 2019 URL: https://arxiv.org/abs/1902.07277
- [7] Philipp Korablev and Vladimir Tarkaev “A Relation Between the Crossing Number and the Height of a Knotoid”, 2020 URL: https://arxiv.org/abs/2009.02718
- [8] Deniz Kutluay “Winding Homology of Knotoids”, 2020 URL: https://arxiv.org/abs/2002.07871