Related papers: A Matrix Positivstellensatz with lifting polynomia…
In pure integer linear programming it is often desirable to work with polyhedra that are full-dimensional, and it is well known that it is possible to reduce any polyhedron to a full-dimensional one in polynomial time. More precisely, using…
There has recently been ample interest in the question of which sets can be represented by linear matrix inequalities (LMIs). A necessary condition is that the set is rigidly convex, and it has been conjectured that rigid convexity is also…
Let $p_{\min}$ denote the minimum of a polynomial $p$ over a (general) compact semialgebraic set $S \subseteq \mathbb{R}^n$. A standard way to approximate $p_{\min}$ is via hierarchies built from Positivstellens\"atze, which certify…
Matrix Completion is the problem of recovering an unknown real-valued low-rank matrix from a subsample of its entries. Important recent results show that the problem can be solved efficiently under the assumption that the unknown matrix is…
We consider a many-to-one variant of the stable matching problem. More concretely, we consider the variant of the stable matching problem where one side has a matroid constraint. Furthermore, we consider the situation where the preference…
This paper serves as an introduction to banded totally positive matrices, exploring various characterizations and associated properties. A significant result within is the demonstration that the collection of such matrices forms a…
2-level polytopes naturally appear in several areas of pure and applied mathematics, including combinatorial optimization, polyhedral combinatorics, communication complexity, and statistics. In this paper, we present a study of some 2-level…
Let $\widehat{\mathscr O}$ be a complete local principal ideal ring with residue field $k$ of characteristic not $2$ and $f\in \widehat{\mathscr O}[x_1,x_2,\dots,x_m]$. Take $A\in \mathrm M_n(\widehat{\mathscr O})$ with its reduction…
Given a pure, full-dimensional, locally strongly connected polyhedral complex C with convex support, we characterize, by a local codimension-2 condition, polyhedral complexes that coarsen C. The proof of the characterization draws upon a…
If a tuple of matrices has a common invariant subspace, its projective joint spectrum has an algebraic component. In general, the converse is not true, and there might be algebraic components in the projective joint spectrum without…
Recently, the second and the third author developed sums of nonnegative circuit polynomials (SONC) as a new certificate of nonnegativity for real polynomials, which is independent of sums of squares. In this article we show that the SONC…
Signomials are obtained by generalizing polynomials to allow for arbitrary real exponents. This generalization offers great expressive power, but has historically sacrificed the organizing principle of ``degree'' that is central to…
Not every positive functional defined on bi-variate polynomials of a prescribed degree bound is represented by the integration against a positive measure. We isolate a couple of conditions filling this gap, either by restricting the class…
Matrix completion refers to completing a low-rank matrix from a few observed elements of its entries and has been known as one of the significant and widely-used problems in recent years. The required number of observations for exact…
Given an $\mathcal{H}$-polytope $P$ and a $\mathcal{V}$-polytope $Q$, the decision problem whether $P$ is contained in $Q$ is co-NP-complete. This hardness remains if $P$ is restricted to be a standard cube and $Q$ is restricted to be the…
The low-rank matrix completion problem asks whether a given real matrix with missing values can be completed so that the resulting matrix has low rank or is close to a low-rank matrix. The completed matrix is often required to satisfy…
Many uncertainty sets encountered in control systems analysis and design can be expressed in terms of semialgebraic sets, that is as the intersection of sets described by means of polynomial inequalities. Important examples are for instance…
We analyze how symmetries can be used to compress structures (also known as interpretations) onto a smaller domain without loss of information. This analysis suggests the possibility to solve satisfiability problems in the compressed domain…
The problem of finding completely positive matrices with equal cp-rank and rank is considered. We give some easy-to-check sufficient conditions on the entries of a doubly nonnegative matrix for it to be completely positive with equal…
We consider the problem of approximating a semialgebraic set with a sublevel-set of a polynomial function. In this setting, it is standard to seek a minimum volume outer approximation and/or maximum volume inner approximation. As there is…