Three-page encoding and complexity theory for spatial graphs

Details Three-page encoding and complexity theory for spatial graphs Three-page encoding and complexity theory for spatial graphs

2004-07-19

arxiv.org/abs/math/0407321v1

Mathematics

Geometric Topology

32 pages with 9 figures, submitted to J.Knot Theory and Ram

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

Three-page encoding and complexity theory for spatial graphs does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Three-page encoding and complexity theory for spatial graphs, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Three-page encoding and complexity theory for spatial graphs will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-535715