Complexity of atriodic continua

Details Complexity of atriodic continua Complexity of atriodic continua

2009-05-12

arxiv.org/abs/0905.1978v1

Mathematics

General Topology

Scientific paper

This dissertation investigates the relative complexity between a continuum and its proper subcontinua, in particular, providing examples of atriodic n-od-like continua. Let X be a continuum and n be an integer greater than or equal to three. If X is homeomorphic to an inverse limit of simple-n-od graphs with simplicial bonding maps and is simple-(n-1)-od-like, it is shown that the bonding maps can be simplicially factored through a simple-(n-1)-od. This implies, in particular, that X is homeomorphic to an inverse limit of simple-(n-1)-od graphs with simplicial bonding maps. This factoring is subsequently used to show that a specific inverse limit of simple-n-ods with simplicial bonding maps, having the property of every proper nondegenerate subcontinuum being an arc, is not simple-(n-1)-od-like.

Affiliated with

Also associated with

No associations

Rating

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

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-128373