On Realizability Of Gauss Diagrams And Constructions Of Meanders
Algebraic Topology
2018-10-05 v2 Geometric Topology
Abstract
The problem of which Gauss diagram can be realized by plane curves 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 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. We give a matrix approach of realization of Gauss diagrams and then we present an algorithm to construct meanders
Cite
@article{arxiv.1808.08542,
title = {On Realizability Of Gauss Diagrams And Constructions Of Meanders},
author = {Andrey Grinblat and Viktor Lopatkin},
journal= {arXiv preprint arXiv:1808.08542},
year = {2018}
}
Comments
the first version in Russin, and the second one in English. arXiv admin note: text overlap with arXiv:math/0404490, arXiv:math/9810073 by other authors