Hyperspace Selections Avoiding Points
Valentin Gutev

TL;DR
This paper explores hyperspace selection problems in connected spaces, providing characterizations of compact orderable and weakly cyclically orderable spaces through selection properties and ternary relations.
Contribution
It introduces new characterizations of compact orderable and weakly cyclically orderable spaces based on hyperspace selection properties.
Findings
Characterization of compact orderable spaces via selection properties.
Equivalence of selection properties for two-point sets to the existence of cyclic orders.
Introduction of weakly cyclically orderable spaces.
Abstract
In this paper, we deal with a hyperspace selection problem in the setting of connected spaces. We present two solutions of this problem illustrating the difference between selections for the nonempty closed sets, and those for the at most two-point sets. In the first case, we obtain a characterisation of compact orderable spaces. In the latter case -- that of selections for at most two-point sets, the same selection property is equivalent to the existence of a ternary relation on the space, known as a cyclic order, and gives a characterisation of the so called weakly cyclically orderable spaces.
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
TopicsAdvanced Topology and Set Theory · Advanced Algebra and Logic · Constraint Satisfaction and Optimization
