Three-page encoding and complexity theory for spatial graphs

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.
Document type :
Preprints, Working Papers, ...
Complete list of metadatas
Contributor : Import Arxiv <>
Submitted on : Wednesday, November 2, 2005 - 12:17:11 PM
Last modification on : Friday, June 8, 2018 - 2:50:07 PM

Links full text




V. Kurlin. Three-page encoding and complexity theory for spatial graphs. 2004. ⟨hal-00013009⟩



Record views