pith. sign in

arxiv: 0908.1981 · v2 · pith:AEDM7JBEnew · submitted 2009-08-14 · 🧮 math.GT

Classical and Virtual Pseudodiagram Theory and New Bounds on Unknotting Numbers and Genus

classification 🧮 math.GT
keywords knottheorydiagraminformationnumberpseudodiagramunknottingvirtual
0
0 comments X
read the original abstract

A pseudodiagram is a diagram of a knot with some crossing information missing. We review and expand the theory of pseudodiagrams introduced by R. Hanaki. We then extend this theory to the realm of virtual knots, a generalization of knots. In particular, we investigate how much crossing information must be known to conclude that a diagram is a diagram of the unknot (the trivializing number). We also consider how much information is necessary to identify a non-trivial knot, a classical knot, or a non-classical knot. We then apply pseudodiagram theory to develop new upper bounds on unknotting number, virtual unknotting number, and genus.

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.