• Refine Query
  • Source
  • Publication year
  • to
  • Language
  • 2
  • Tagged with
  • 2
  • 2
  • 2
  • 2
  • About
  • The Global ETD Search service is a free service for researchers to find electronic theses and dissertations. This service is provided by the Networked Digital Library of Theses and Dissertations.
    Our metadata is collected from universities around the world. If you manage a university/consortium/country archive and want to be added, details can be found on the NDLTD website.
1

Non-chainable Continua and Lelek's Problem

Hoehn, Logan Cedric 09 June 2011 (has links)
The set of compact connected metric spaces (continua) can be divided into classes according to the complexity of their descriptions as inverse limits of polyhedra. The simplest such class is the collection of chainable continua, i.e. those which are inverse limits of arcs. In 1964, A. Lelek introduced a notion which is related to chainability, called span zero. A continuum X has span zero if any two continuous maps from any other continuum to X with identical ranges have a coincidence point. Lelek observed that every chainable continuum has span zero; he later asked whether span zero is in fact a characterization of chainability. In this thesis, we construct a non-chainable continuum in the plane which has span zero, thus providing a counterexample for what is now known as Lelek's Problem in continuum theory. Moreover, we show that the plane contains an uncountable family of pairwise disjoint copies of this continuum. We discuss connections with the classical problem of determining up to homeomorphism all the homogeneous continua in the plane.
2

Non-chainable Continua and Lelek's Problem

Hoehn, Logan Cedric 09 June 2011 (has links)
The set of compact connected metric spaces (continua) can be divided into classes according to the complexity of their descriptions as inverse limits of polyhedra. The simplest such class is the collection of chainable continua, i.e. those which are inverse limits of arcs. In 1964, A. Lelek introduced a notion which is related to chainability, called span zero. A continuum X has span zero if any two continuous maps from any other continuum to X with identical ranges have a coincidence point. Lelek observed that every chainable continuum has span zero; he later asked whether span zero is in fact a characterization of chainability. In this thesis, we construct a non-chainable continuum in the plane which has span zero, thus providing a counterexample for what is now known as Lelek's Problem in continuum theory. Moreover, we show that the plane contains an uncountable family of pairwise disjoint copies of this continuum. We discuss connections with the classical problem of determining up to homeomorphism all the homogeneous continua in the plane.

Page generated in 0.0505 seconds