The Nadler-Quinn problem on accessible points of arc-like continua
Andrea Ammerlaan, Ana Anu\v{s}i\'c, Logan C. Hoehn

TL;DR
This paper proves that every point in an arc-like continuum can be made accessible through a plane embedding, solving a longstanding problem in continuum theory and developing new theories of interval map factorizations.
Contribution
It introduces the theories of truncations and contour factorizations of interval maps to solve the Nadler-Quinn problem.
Findings
Every point in an arc-like continuum can be accessible in some plane embedding.
Answers the Nadler-Quinn problem posed in 1972.
Provides new insights into inequivalent embeddings of indecomposable arc-like continua.
Abstract
We show that if is an arc-like continuum, then for every point there is a plane embedding of in which is an accessible point. This answers a question posed by Nadler in 1972, which has become known as the Nadler-Quinn problem in continuum theory. Towards this end, we develop the theories of truncations and contour factorizations of interval maps. As a corollary, we answer a question of Mayer from 1982 about inequivalent plane embeddings of indecomposable arc-like continua.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsMathematical Dynamics and Fractals · advanced mathematical theories · Computational Geometry and Mesh Generation
