Lower bounds on virtual crossing number and minimal surface genus
classification
🧮 math.GT
keywords
virtualboundscrossinggenuslowerminimalnumbersurface
read the original 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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.