Related papers: Convex choice, finite choice and sorting
Given a computable sequence of natural numbers, it is a natural task to find a G\"odel number of a program that generates this sequence. It is easy to see that this problem is neither continuous nor computable. In algorithmic learning…
In this paper, the first family of conforming discrete three dimensional Gradgrad-complexes consisting of finite element spaces is constructed. These discrete complexes are exact in the sense that the range of each discrete map is the…
In this note we provide a full conjugacy and subdifferential calculus for convex convex-composite functions in finite-dimensional space. Our approach, based on infimal convolution and cone-convexity, is straightforward and yields the…
Like termination, confluence is a central property of rewrite systems. Unlike for termination, however, there exists no known complexity hierarchy for confluence. In this paper we investigate whether the decreasing diagrams technique can be…
This paper gives two different proofs to a structural theorem of decreasing minimization (lexicographic optimization) on integrally convex sets. The theorem states that the set of decreasingly minimal elements of an integrally convex set…
In our previous papers we introduced categorical invariants, which are, roughly speaking, sets of triangulated subcategories in a given triangulated category and their quotients. Here is extended the list of examples, where these sets are…
This article investigates the numerical approximation of shape optimization problems with PDE constraint on classes of convex domains. The convexity constraint provides a compactness property which implies well posedness of the problem.…
The concept of convex compactness, weaker than the classical notion of compactness, is introduced and discussed. It is shown that a large class of convex subsets of topological vector spaces shares this property and that is can be used in…
We prove an abstract criterion that a surjective convolution operator in spaces of analytic functions on convex subsets of the complex plane has a continuous linear right inverse. Considered convex sets have a countable neighborhood basis…
Under large cardinal hypotheses beyond the Kunen inconsistency -- hypotheses so strong as to contradict the Axiom of Choice -- we solve several variants of the generalized continuum problem and identify structural features of the levels…
We study the class of compact convex subsets of a topological vector space which admits a strictly convex and lower semicontinuous function. We prove that such a compact set is embeddable in a strictly convex dual Banach space endowed with…
Cutting a polytope is a very natural way to produce new classes of interesting polytopes. Moreover, it has been very enlightening to explore which algebraic and combinatorial properties of the orignial polytope are hereditary to its…
Let $n$ and $k$ be nonnegative integers such that $1\le k\le n+1$. The convex cone $\mathcal{F}_+^{k:n}$ of all functions $f$ on an arbitrary interval $I\subseteq\mathbb{R}$ whose derivatives $f^{(j)}$ of orders $j=k-1,\dots,n$ are…
We propose new sequential simulation-optimization algorithms for general convex optimization via simulation problems with high-dimensional discrete decision space. The performance of each choice of discrete decision variables is evaluated…
We show an extension of a probabilistic result of Marcus, Spielman, and Srivastava, which resolved the Kadison-Singer problem, for block diagonal positive semidefinite random matrices. We use this result to show several selector results,…
We develop an algorithmic theory of convex optimization over discrete sets. Using a combination of algebraic and geometric tools we are able to provide polynomial time algorithms for solving broad classes of convex combinatorial…
We introduce a recursive method to deconstruct the automorphism group of an ordered set. By connecting this method with deep results for permutation groups, we prove the Automorphism Conjecture for ordered sets of width less than or equal…
We prove the conjecture that higher Verlinde categories are geometrically reductive. This is one of the two properties required in order for recent results on algebraic geometry in tensor categories to apply to these categories. We also…
This paper introduces the concept of the dimension of a triangulated category with respect to a fixed full subcategory. For the bounded derived category of an abelian category, upper bounds of the dimension with respect to a contravariantly…
Every polyhedron can be decomposed into a Minkowski sum (or vector sum) of a bounded polyhedron and a polyhedral cone. This paper establishes similar statements for some classes of discrete sets in discrete convex analysis, such as…