Three-page encoding and complexity theory for spatial graphs
Geometric Topology
2007-05-23 v1
Abstract
We construct a series of finitely presented semigroups. The centers of these semigroups encode uniquely up to rigid ambient isotopy in 3-space all non-oriented spatial graphs. This encoding is obtained by using three-page embeddings of graphs into the product of the line with the cone on three points. By exploiting three-page embeddings we introduce the notion of the three-page complexity for spatial graphs. This complexity satisfies the properties of finiteness and additivity under natural operations.
Cite
@article{arxiv.math/0407321,
title = {Three-page encoding and complexity theory for spatial graphs},
author = {V. Kurlin},
journal= {arXiv preprint arXiv:math/0407321},
year = {2007}
}
Comments
32 pages with 9 figures, submitted to J.Knot Theory and Ram