Papers
Topics
Authors
Recent
Search
2000 character limit reached

On Virtual Crossing Numbers for Virtual Knots

Published 25 Jul 2011 in math.GT | (1107.4828v1)

Abstract: The aim of the present paper is to prove that the minimal number of virtual crossings for some families of virtual knots grows quadratically with respect to the minimal number of classical crossings. All previously known estimates for virtual crossing number were principally no more than linear in the number of classical crossings (or, what is the same, in the number of edges of a virtual knot diagram) and no virtual knot was found with virtual crossing number greater than the classical crossing number.

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

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.