Three-page encoding and complexity theory for spatial graphs
V. Kurlin
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.
Create a lesson
Related papers
Chromatic Spherical and Renormalized Reshetikhin-Turaev Invariants for Drinfeld Centers
Nicolas Bridges, Shawn Cui, Nathan Geer
3-manifold decision problems and Riemann hypotheses
John A. Baldwin, Steven Sivek
On the (in)finiteness of fixed characters in genus 3
Yixuan Fu
Non-Pseudo-Arithmetic Hyperbolic 4-Manifolds
Alexander Kolpakov
Convex ribbon disks, quasipositivity, and Lagrangian sliceness
Joseph Breen, Alexander Zupan
A Smooth Shioda-Tate Isomorphism for Elliptically Fibered 4-Manifolds
Maria Morariu