arXiv · 1610.01440
On Realizability of Gauss Diagrams
Abstract
The problem of which Gauss diagram can be realized by knots is an old one and has been solved in several ways. In this paper, we present a direct approach to this problem. We show that the needed conditions for realizability of a Gauss diagram can be interpreted as follows "the number of exits = the number of entrances" and the sufficient condition is based on Jordan curve Theorem.
Explore related subjects
Keep this discovery
Andrey Grinblat, Viktor Lopatkin. 2016-09-21. On Realizability of Gauss Diagrams. https://arxiv.org/abs/1610.01440
Cite the original work for its findings. Save a collection to share your selection of sources.