Related papers: Convex choice, finite choice and sorting
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…
We study the computational content of the Brouwer Fixed Point Theorem in the Weihrauch lattice. Connected choice is the operation that finds a point in a non-empty connected closed set given by negative information. One of our main results…
We systematically study the completion of choice problems in the Weihrauch lattice. Choice problems play a pivotal role in Weihrauch complexity. For one, they can be used as landmarks that characterize important equivalences classes in the…
In this paper we study a new approach to classify mathematical theorems according to their computational content. Basically, we are asking the question which theorems can be continuously or computably transferred into each other? For this…
We identify a notion of reducibility between predicates, called instance reducibility, which commonly appears in reverse constructive mathematics. The notion can be generally used to compare and classify various principles studied in…
While faces of a polytope form a well structured lattice, in which faces of each possible dimension are present, this is not true for general compact convex sets. We address the question of what dimensional patterns are possible for the…
We explore the low levels of the structure of the continuous Weihrauch degrees of first-order problems. In particular, we show that there exists a minimal discontinuous first-order degree, namely that of $\accn$, without any determinacy…
We construct a nonrecursive set \(A\le_T\emptyset'\) and a uniformly computable family of sets \(C_0,C_1,\dots\), all bounded finite-one equivalent to \(A\), such that the corresponding \(1\)-degrees form a copy of the dense linear order…
We study a combinatorial notion where given a set of lattice points one takes the set of all sums of subsets of a fixed size, and we ask if the given set comes from a convex lattice polytope whether the resulting set also comes from a…
We study $\mathbb{R}^2\oplus\mathbb{R}$-separately convex hulls of finite sets of points in $\mathbb{R}^3$, as in KirchheimMullerSverak2003. This notion of convexity, which we call $2+1$ convexity, corresponds to rank-one convex convexity,…
The Weihrauch degrees are a tool to gauge the computational difficulty of mathematical problems. Often, what makes these problems hard is their discontinuity. We look at discontinuity in its purest form, that is, at otherwise constant…
The famous Koecher-Vinberg theorem characterises the finite dimensional formally real Jordan algebras among the finite dimensional order unit spaces as the ones that have a symmetric cone. An alternative characterisation of symmetric cones…
In this paper, we study homological dimensions of algebras linked by recollements of derived module categories, and establish a series of new upper bounds and relationships among their finitistic or global dimensions. This is closely…
We study the problems of testing and learning high-dimensional discrete convex sets. The simplest high-dimensional discrete domain where convexity is a non-trivial property is the ternary hypercube, $\{-1,0,1\}^n$. The goal of this work is…
Weihrauch reducibility is a notion of reducibility between computational problems that is useful to calibrate the uniform computational strength of a multivalued function. It complements the analysis of mathematical theorems done in reverse…
We define a dimension for a triangulated category. We prove a representabilityTheorem for a certain class of functors on finite dimensional triangulatedcategories. We study the dimension of the boundedderived category of an algebra or a…
We investigate $(0,1)$-matrices that are {\em convex}, which means that the ones are consecutive in every row and column. These matrices occur in discrete tomography. The notion of ranked essential sets, known for permutation matrices, is…
Given a finite covering by closed convex sets of $B_X$, the unit ball of an infinite-dimensional Banach space, we investigate whether there is a set of the covering that contains balls of radius close to $1$ and (a) arbitrarily high finite…
We explore the Weihrauch degree of the problems ``find a bad sequence in a non-well quasi order'' ($\mathsf{BS}$) and ``find a descending sequence in an ill-founded linear order'' ($\mathsf{DS}$). We prove that $\mathsf{DS}$ is strictly…
We study the order dimension of the lattice of closed sets for a convex geometry. Further, we prove the existence of large convex geometries realized by planar point sets that have very low order dimension. We show that the planar point set…