Cookies

We use cookies to ensure that we give you the best experience on our website. You can change your cookie settings at any time. Otherwise, we'll assume you're OK to continue.


Durham Research Online
You are in:

Three-page encoding and complexity theory for spatial graphs.

Kurlin, V. (2007) 'Three-page encoding and complexity theory for spatial graphs.', Journal of knot theory and its ramifications., 16 (1). pp. 59-102.

Abstract

A finitely presented semigroup RSGn is constructed for n ≥ 2. The centre of RSGn encodes uniquely up to rigid ambient isotopy in 3-space all nonoriented spatial graphs with vertices of degree ≤ n. This encoding is obtained by using three-page embeddings of graphs into the three-page book T × I, where T is the cone on three points, and I is the unit segment. The notion of the three-page complexity for spatial graphs is introduced via three-page embeddings. This complexity satisfies the properties of finiteness and additivity under natural operations.

Item Type:Article
Additional Information:
Keywords:Spatial graph, Ambient isotopy, Isotopy classification, Universal semigroup, Spatial graph, Ambient isotopy, Isotopy classification, Universal semigroup, Three-page embedding.
Full text:Full text not available from this repository.
Publisher Web site:http://dx.doi.org/10.1142/S021821650700521X
Record Created:21 Sep 2007
Last Modified:08 Apr 2009 16:36

Social bookmarking: del.icio.usConnoteaBibSonomyCiteULikeFacebookTwitterExport: EndNote, Zotero | BibTex
Usage statisticsLook up in GoogleScholar | Find in a UK Library