Three-page encoding and complexity theory for spatial graphs

Thumbnail Image

Date

Authors

Journal Title

Journal ISSN

Volume Title

Publisher

Abstract

Description

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.
32 pages with 9 figures, submitted to J.Knot Theory and Ram

Keywords

Geometric Topology, 57M25, 57M15, 57M05

Citation

URI

http://salesiana.dossiersoluciones.com/handle/123456789/71938

Consulte el texto completo en el siguiente enlace:

https://arxiv.org/abs/math/0407321
 http://arxiv.org/abs/math/0407321

Collections

arXiv