Lower bounds on virtual crossing number and minimal surface genus
Abstract
We compute lower bounds on the virtual crossing number and minimal surface genus of virtual knot diagrams from the arrow polynomial. In particular, we focus on several interesting examples.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.