Photo by lunarts from unsplash
We consider the homeomorphic classification of finite-dimensional continua as well as several related equivalence relations. We show that, when $n \geq 2$, the classification problem of $n$-dimensional continua is strictly… Click to show full abstract
We consider the homeomorphic classification of finite-dimensional continua as well as several related equivalence relations. We show that, when $n \geq 2$, the classification problem of $n$-dimensional continua is strictly more complex than the isomorphism problem of countable graphs. We also obtain results that compare the relative complexity of various equivalence relations.
Keywords:
dimensional continua;
complexity classification;
finite dimensional;
classification
Journal Title: Topology and its Applications
Year Published: 2019
Link to full text (if available)
Share on Social Media: Sign Up to like & get
recommendations!
Journal Title: Topology and its Applications
Year Published: 2019
Link to full text (if available)
Share on Social Media: Sign Up to like & get
recommendations!