Related papers: Containment Problems for Projections of Polyhedra …
In [1], two of the present authors along with P. Raman attempted to extend the Amplituhedron program for scalar field theories [2] to quartic scalar interactions. In this paper we develop various aspects of this proposal. Using recent…
A spectrahedron is a set defined by a linear matrix inequality. Given a spectrahedron we are interested in the question of the smallest possible size $r$ of the matrices in the description by linear matrix inequalities. We show that for the…
This paper presents a selected tour through the theory and applications of lifts of convex sets. A lift of a convex set is a higher-dimensional convex set that projects onto the original set. Many convex sets have lifts that are…
The Helton-Nie Conjecture (HNC) is the proposition that every convex semialgebraic set is a spectrahedral shadow. Here we prove that HNC is equivalent to another propo- sition related to quadratically constrained quadratic programming.…
We analyze self-dual polyhedral cones and prove several properties about their slack matrices. In particular, we show that self-duality is equivalent to the existence of a positive semidefinite (PSD) slack. Beyond that, we show that if the…
We consider the optimal containment of polygonal regions within convex containers with the special property of 'orientedness' - an oriented region enables us to choose a preferred direction on the plane (this direction is not necessarily an…
This work provides two sufficient conditions in terms of sections or projections for a convex body to be a polytope. These conditions are necessary as well.
We prove that a closed convex subset $C$ of a complete linear metric space $X$ is polyhedral in its closed linear hull if and only if no infinite subset $A\subset X\backslash C$ can be hidden behind $C$ in the sense $[x,y]\cap C\not =…
Representations of nonnegative polynomials as sums of squares are central to real algebraic geometry and the subject of active research. The sum-of-squares representations of a given polynomial are parametrized by the convex body of…
For an $n \times n$ nonnegative matrix $P$, an isomorphism is obtained between the lattice of initial subsets (of ${1,...,n}$) for $P$ and the lattice of $P$-invariant faces of the nonnegative orthant $\IR^{n}_{+}$. Motivated by this…
Finite element simulations have been used to solve various partial differential equations (PDEs) that model physical, chemical, and biological phenomena. The resulting discretized solutions to PDEs often do not satisfy requisite physical…
We give an elementary introduction to some recent polyhedral techniques for understanding and solving systems of multivariate polynomial equations. We provide numerous concrete examples and illustrations, and assume no background in…
Automating the solutions of multiple network information theory problems, stretching from fundamental concerns such as determining all information inequalities and the limitations of linear codes, to applied ones such as designing coded…
A set is called semidefinite representable or semidefinite programming (SDP) representable if it can be represented as the projection of a higher dimensional set which is represented by some Linear Matrix Inequality (LMI). This paper…
Polyhedral convex set optimization problems are the simplest optimization problems with set-valued objective function. Their role in set optimization is comparable to the role of linear programs in scalar optimization. Vector linear…
We consider the problem of the semidefinite representation of a class of non-compact basic semialgebraic sets. We introduce the conditions of pointedness and closedness at infinity of a semialgebraic set and show that under these conditions…
In a containment problem, the goal is to preprocess a set of geometric objects so that, given a geometric query object, we can report all the objects containing the query object. We consider the containment problem where input objects are…
Sublinear circuits are generalizations of the affine circuits in matroid theory, and they arise as the convex-combinatorial core underlying constrained non-negativity certificates of exponential sums and of polynomials based on the…
Spectrahedra are affine-linear sections of the cone $\mathcal{P}_n$ of positive semidefinite symmetric $n\times n$-matrices. We consider random spectrahedra that are obtained by intersecting~$\mathcal{P}_n$ with the affine-linear space…
In this paper, by refining approximation theorems for holomorphic sections of adjoint line bundles, it is proved that the regular locus of a weakly pseudoconvex complex space admitting a positive line bundle can be holomorphically embedded…