Three-page encoding and complexity theory for spatial graphs

Simple item page
dc.creatorKurlin, V.
dc.date2004-07-19
dc.date.accessioned2026-07-07T05:10:27Z
dc.date.available2026-07-07T05:10:27Z
dc.descriptionWe 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.
dc.description32 pages with 9 figures, submitted to J.Knot Theory and Ram
dc.identifierhttps://arxiv.org/abs/math/0407321
dc.identifierhttp://arxiv.org/abs/math/0407321
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/71938
dc.subjectGeometric Topology
dc.subject57M25, 57M15, 57M05
dc.titleThree-page encoding and complexity theory for spatial graphs
dc.typetext

Files

Collections

arXiv