Arc numbers from Gauss diagrams
Geometric Topology
2010-11-02 v1
Abstract
We characterize planar diagrams which may be divided into n arc embeddings in terms of their chord diagrams, generalizing a result of Taniyama for the case n = 2. Two algorithms are provided, one which finds a minimal arc embedding (in quadradic time in the number of crossings), and one which constructs a minimal subdiagram having same arc number as D.
Keywords
Cite
@article{arxiv.1011.0318,
title = {Arc numbers from Gauss diagrams},
author = {Tobias Hagge},
journal= {arXiv preprint arXiv:1011.0318},
year = {2010}
}
Comments
4 pages, 1 figure