Related papers: A Complementarity Partition Theorem for Multifold …

Every ordered collection of sets in Euclidean space can be associated to a combinatorial code, which records the regions cut out by the sets in space. Given two ordered collections of sets, one can form a third collection in which the…

We introduce the multiset partition algebra, ${\rm M\!P}_{r,k}(x)$, that has bases elements indexed by multiset partitions, where $x$ is an indeterminate and $r$ and $k$ are non-negative integers. This algebra can be realized as a diagram…

We show how the separability problem is dual to that of decomposing any given matrix into a conic combination of rank-one partial isometries, thus offering a duality approach different to the positive maps characterization problem. Several…

Although the Karush-Kuhn-Tucker conditions suggest a connection between a conic optimization problem and a complementarity problem, it is difficult to find an accessible explicit form of this relationship in the literature. This note will…

We here show that the family of continuous-time linear systems (of prescribed dimensions) can be characterized through the structure of maximal, matrix-convex, cones, closed under inversion. Moreover, this observation unifies three setups:…

The famous pancake theorem states that for every finite set $X$ in the plane, there exist two orthogonal lines that divide $X$ into four equal parts. We propose an algorithm whose running time is linear in the number of points in $X$ and…

This paper gives the most general form of the Adler-Kostant-Symes Theorem, and many applications of it, both finite and infinite dimensional, the former yielding algebraic completely integrable (a.c.i.) systems, and the latter examples in…

This paper presents an algorithmic study of a class of covering mixed-integer linear programming problems which encompasses classic cover problems, including multidimensional knapsack, facility location and supplier selection problems. We…

Let K(X) be the collection of all non-zero finite dimensional subspaces of rational functions on an n-dimensional irreducible variety X. For any n-tuple L_1,..., L_n in K(X), we define an intersection index [L_1,..., L_n] as the number of…

The general theme of this note is illustrated by the following theorem: Theorem 1. Suppose $K$ is a compact set in the complex plane and 0 belongs to the boundary $\partial K$. Let ${\cal A}(K)$ denote the space of all functions $f$ on $K$…

Categories of partitions are combinatorial structures arising from the representation theory of certain compact quantum groups and are linked to classical diagram algebras such as the Temperley-Lieb algebra. In this paper, we present…

Index maps taking values in the $K$-theory of a mapping cone are defined and discussed. The resulting index theorem can be viewed in analogy with the Freed-Melrose index theorem. The framework of geometric $K$-homology is used in a…

Let R=K[M] be a normal affine monoid algbera over a field K.Up to isomorphism the conic ideals are exactly the direct summands ofthe extension R^{1/n} of R. We show that the classes of the conic divisorial ideals can be identified with the…

Let C be a clutter and let A be its incidence matrix. If the linear system x>=0;xA<=1 has the integer rounding property, we give a description of the canonical module and the a-invariant of certain normal subrings associated to C. If the…

We consider the nonlinear integer programming problem of minimizing a quadratic function over the integer points in variable dimension satisfying a system of linear inequalities. We show that when the Graver basis of the matrix defining the…

We present a geometrical analysis on the completely positive programming reformulation of quadratic optimization problems and its extension to polynomial optimization problems with a class of geometrically defined nonconvex conic programs…

Let $N$ be a lattice of rank $n$ and let $M = N^{\vee}$ be its dual lattice. In this note we show that given two compact, bounded, full-dimensional convex sets $K_1 \subseteq K_2 \subseteq M_{\R} \coloneqq M \otimes_{\Z} \R$, there is a…

We characterize sequences of positive integers $(a_1,a_2,\ldots,a_n)$ for which the $2\times2$ matrix $\left( \begin{array}{cc} a_n&-1 1&0 \end{array} \right) \left( \begin{array}{cc} a_{n-1}&-1 1&0 \end{array} \right) \cdots \left(…

We study the integrality gap of convex mixed-integer programs, that is, the difference between the optimal value of such a problem and the optimal value of its continuous relaxation. We study classes of convex sets whose associated…

We introduce the notion of one-sided mapping cones of positive linear maps between matrix algebras. These are convex cones of maps that are invariant under compositions by completely positive maps from either the left or right side. The…