Algorithmic aspects of homeomorphism problems

Details Algorithmic aspects of homeomorphism problems Algorithmic aspects of homeomorphism problems

1997-07-27

arxiv.org/abs/math/9707232v1

Mathematics

Geometric Topology

Scientific paper

We will describe some results regarding the algorithmic nature of homeomorphism problems for manifolds; in particular, the following theorem. Theorem 1: Every PL or smooth simply connected manifold M^n of dimension n at least 5 can be recognized among simply connected manifolds. That is, there is an algorithm to decide whether or not another simply connected manifold is Top, PL or Diff isomorphic to M. Moreover, an analogous statement is true for embeddings in codimension at least three: one can algorithmically recognize any given embedding of one simply connected manifold in another up to isomorphism of pairs, or up to isotopy, if the codimension of the embedding is not two.

Affiliated with

Also associated with

No associations

Rating

Algorithmic aspects of homeomorphism problems 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 Algorithmic aspects of homeomorphism problems, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Algorithmic aspects of homeomorphism problems will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-512055