Closed Choice for Finite and for Convex Sets
- Cite this paper as:
- Le Roux S., Pauly A. (2013) Closed Choice for Finite and for Convex Sets. In: Bonizzoni P., Brattka V., Löwe B. (eds) The Nature of Computation. Logic, Algorithms, Applications. CiE 2013. Lecture Notes in Computer Science, vol 7921. Springer, Berlin, Heidelberg
We investigate choice principles in the Weihrauch lattice for finite sets on the one hand, and convex sets on the other hand. Increasing cardinality and increasing dimension both correspond to increasing Weihrauch degrees. Moreover, we demonstrate that the dimension of convex sets can be characterized by the cardinality of finite sets encodable into them. Precisely, choice from an n + 1 point set is reducible to choice from a convex set of dimension n, but not reducible to choice from a convex set of dimension n − 1.
Unable to display preview. Download preview PDF.