Centers of a dendroid

Volume 189 / 2006

Jo Heath, Van C. Nall Fundamenta Mathematicae 189 (2006), 173-183 MSC: Primary 54F50; Secondary 54F15. DOI: 10.4064/fm189-2-6

Abstract

A bottleneck in a dendroid is a continuum that intersects every arc connecting two non-empty open sets. Piotr Minc proved that every dendroid contains a point, which we call a center, contained in arbitrarily small bottlenecks. We study the effect that the set of centers in a dendroid has on its structure. We find that the set of centers is arc connected, that a dendroid with only one center has uncountably many arc components in the complement of the center, and that, in this case, every open set intersects uncountably many of these arc components. Moreover, we find that a map from one dendroid to another preserves the center structure if each point inverse has at most countably many components.

Authors

  • Jo HeathMathematics Department
    Parker Hall
    Auburn University
    Auburn, AL 36849-5310, U.S.A.
    e-mail
  • Van C. NallDepartment of Mathematics and Computer Science
    University of Richmond
    Richmond, VA 23173, U.S.A.
    e-mail

Search for IMPAN publications

Query phrase too short. Type at least 4 characters.

Rewrite code from the image

Reload image

Reload image