Related papers: Deciding polyhedrality of spectrahedra
Utilizing dual descriptions of the normal cone of convex optimization problems in conic form, we characterize the vertices of semidefinite representations arising from Lov\'asz theta body, generalizations of the elliptope, and related…
A polyiamond is a polygon composed of unit equilateral triangles, and a generalized deltahedron is a convex polyhedron whose every face is a convex polyiamond. We study a variant where one face may be an exception. For a convex polygon P,…
Eberhard-type theorems are statements about the realizability of a polytope (or more general polyhedral maps) given the valency of its vertices and sizes of its polygonal faces up to a linear linear degree of freedom. We present new…
The image and the inverse image of a polyhedron under a linear transformation are polyhedrons.
This is a chapter in an upcoming Tamari Festscrift. Permutahedra are a class of convex polytopes arising naturally from the study of finite reflection groups, while generalized associahedra are a class of polytopes indexed by finite…
We prove that the complement ${\mathcal S}:={\mathbb R}^3\setminus{\mathcal K}$ of a 3-dimensional convex polyhedron ${\mathcal K}\subset{\mathbb R}^3$ and its closure $\overline{{\mathcal S}}$ are polynomial images of ${\mathbb R}^3$. The…
We present a simple algorithm for determining the extremal points in Euclidean space whose convex hull is the nth polytope in the sequence known as the multiplihedra. This answers the open question of whether the multiplihedra could be…
Consider a convex set S defined by a matrix inequality of polynomials or rational functions over a domain. The set S is called semidefinite programming (SDP) representable or just semidefinite representable if it equals the projection of a…
This paper considers matrix convex sets invariant under several types of rotations. It is known that matrix convex sets that are free semialgebraic are solution sets of Linear Matrix Inequalities (LMIs); they are called free spectrahedra.…
A bounded set $\Omega \subset \mathbb{R}^d$ is called a spectral set if the space $L^2(\Omega)$ admits a complete orthogonal system of exponential functions. We prove that a cylindric set $\Omega$ is spectral if and only if its base is a…
An associahedron is a polytope whose vertices correspond to triangulations of a convex polygon and whose edges correspond to flips between them. Using labeled polygons, C. Hohlweg and C. Lange constructed various realizations of the…
Helton and Vinnikov showed that every rigidly convex curve in the real plane bounds a spectrahedron. This leads to the computational problem of explicitly producing a symmetric (positive definite) linear determinantal representation for a…
Our main result is that every n-dimensional polytope can be described by at most (2n-1) polynomial inequalities and, moreover, these polynomials can explicitly be constructed. For an n-dimensional pointed polyhedral cone we prove the bound…
We present a geometric algorithm to compute the geometric kernel of a generic polyhedron. The geometric kernel (or simply kernel) is definedas the set of points from which the whole polyhedron is visible. Whilst the computation of the…
We define a simple orthogonal polyhedron to be a three-dimensional polyhedron with the topology of a sphere in which three mutually-perpendicular edges meet at each vertex. By analogy to Steinitz's theorem characterizing the graphs of…
Containment problems for polytopes and spectrahedra appear in various applications, such as linear and semidefinite programming, combinatorics, convexity and stability analysis of differential equations. This paper explores the theoretical…
A convex polyhedron is Rupert if a hole can be cut into it (making its genus $1$) such that an identical copy of the polyhedron can pass through the hole. Resolving a conjecture of Jerrard-Wetzel-Yuan, Steininger and Yurkevich recently…
Let $X$ be a smooth projective variety over the complex numbers. One knows by the Cone Theorem that the closed cone of curves of $X$ is rational polyhedral whenever $c_1(X)$ is ample. For varieties $X$ such that $c_1(X)$ is not ample,…
Semidefinite programming optimises a linear objective function over a spectrahedron, and is one of the major advances of mathematical optimisation. Spectrahedra are described by linear pencils, which are linear matrix polynomials with…
It is shown that there are examples of distinct polyhedra, each with a Hamiltonian path of edges, which when cut, unfolds the surfaces to a common net. In particular, it is established for infinite classes of triples of tetrahedra.