Papers
Topics
Authors
Recent
Search
2000 character limit reached

Parity in Knotoids

Published 10 May 2019 in math.GT | (1905.04089v1)

Abstract: This paper investigates the parity concept in knotoids in $S2$ and in $\mathbb{R}2$ 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 $\mathbb{R}2$. 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.

Summary

Paper to Video (Beta)

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Collections

Sign up for free to add this paper to one or more collections.