THREE-PAGE ENCODING AND COMPLEXITY THEORY FOR SPATIAL GRAPHS

DOI10.1142/S021821650700521XMaRDI QIDQ3430306zbMATH OpenOpenAlexFDO

Authors Vitaliy Kurlin

Publication date 21 March 2007

Published in Journal of Knot Theory and Its Ramifications (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/math/0407321

zbMATH Keywords

ambient isotopyisotopy classificationspatial graphthree-page complexitythree-page embeddinguniversal semigroup

Mathematics Subject Classification ID

Fundamental group, presentations, free differential calculus (57M05) Relations of low-dimensional topology with graph theory (57M15)

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.

Recommendations

• Dynnikov three-page diagrams of spatial 3-valent graphs
• On the spatial graph
• Basic embeddings of graphs and Dynnikov's three-page embedding method
• Three-page approach to knot theory. Encoding and local moves
• Three-page approach to knot theory. Universal semigroup

Cites work

• Dynnikov three-page diagrams of spatial 3-valent graphs
• Embedding knots and links in an open book II. Bounds on arc index
• Finite-type invariants of knots, links, and graphs
• Three-page approach to knot theory. Encoding and local moves
• Three-page approach to knot theory. Universal semigroup
• Three-page embeddings of singular knots
• Topological chirality of certain molecules

Cited in

(8)

• Three-page approach to knot theory. Encoding and local moves
• Sewing ribbons on graphs in space
• Basic embeddings of graphs and Dynnikov's three-page embedding method
• A fast approximate skeleton with guarantees for any cloud of points in a Euclidean space
• Dynnikov three-page diagrams of spatial 3-valent graphs
• Three-page indices for rational links and pretzel links
• New upper bounds on the ribbonlength of alternating links with bipartite dual graphs
• All 2-dimensional links in 4-space live inside a universal 3-dimensional polyhedron

This page was built for publication: THREE-PAGE ENCODING AND COMPLEXITY THEORY FOR SPATIAL GRAPHS

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3430306)