相关论文: Four Dimensional Polytopes of Minimum Positive Sem…

We give an algorithm for computing approximate PSD factorizations of nonnegative matrices. The running time of the algorithm is polynomial in the dimensions of the input matrix, but exponential in the PSD rank and the approximation error.…

A zero-one matrix is a matrix with entries from $\{0, 1\}$. We study monoids containing only such matrices. A finite set of zero-one matrices generating such a monoid can be seen as the matrix representation of an unambiguous finite…

We relate the maximum semidefinite and linear extension complexity of a family of polytopes to the cardinality of this family and the minimum pairwise Hausdorff distance of its members. This result directly implies a known lower bound on…

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 presents two novel algorithms for approximately projecting symmetric matrices onto the Positive Semidefinite (PSD) cone using Randomized Numerical Linear Algebra (RNLA). Classical PSD projection methods rely on full-rank…

When the standard representation of a crystallographic Coxeter group is reduced modulo an odd prime p, one obtains a finite group G^p acting on some orthogonal space over Z_p . If the Coxeter group has a string diagram, then G^p will often…

The maximum size $A_2(8,6;4)$ of a binary subspace code of packet length $v=8$, minimum subspace distance $d=6$, and constant dimension $k=4$ is $257$, where the $2$ isomorphism types are extended lifted maximum rank distance codes. In…

We consider the convex geometry of the cone of nonnegative quadratics over Stanley-Reisner varieties. Stanley-Reisner varieties (which are unions of coordinate planes) are amongst the simplest real projective varieties, so this is…

One can always decompose Dirichlet-Voronoi polytopes of lattices non-trivially into a Minkowski sum of Dirichlet-Voronoi polytopes of rigid lattices. In this report we show how one can enumerate all rigid positive semidefinite quadratic…

We study the tropicalization of the cone of positive semidefinite matrices over the ordered field of real Puiseux series. The tropical PSD matrices form the normal cone of the Newton polytope of the symmetric determinant at the vertex…

We present slight refinements of known general lower and upper bounds on sizes of extended formulations for polytopes. With these observations we are able to compute the extension complexities of all 0/1-polytopes up to dimension 4. We…

We show that the $f$-vector sets of $d$-polytopes have non-trivial additive structure: They span affine lattices and are embedded in monoids that we describe explicitly. Moreover, for many large subclasses, such as the simple polytopes, or…

In this paper, we study polynomial norms, i.e. norms that are the $d^{\text{th}}$ root of a degree-$d$ homogeneous polynomial $f$. We first show that a necessary and sufficient condition for $f^{1/d}$ to be a norm is for $f$ to be strictly…

We describe a provably complete algorithm for the generation of a tight, possibly exact superset of all combinatorially distinct simple n-facet polytopes in R^d, along with their graphs, f-vectors, and face lattices. The technique applies…

Spectrahedra are affine sections of the cone of positive semidefinite matrices which form a rich class of convex bodies that properly contains that of polyhedra. While the class of polyhedra is closed under linear projections, the class of…

The problem of matrix completion and decomposition in the cone of positive semidefinite (PSD) matrices is a well-understood problem, with many important applications in areas such as linear algebra, optimization, and control theory. This…

If P is a rational polytope in R^d, then $i_P(t):=#(tP\cap Z^d)$ is a quasi-polynomial in t, called the Ehrhart quasi-polynomial of P. A period of i_P(t) is D(P), the smallest positive integer D such that D*P has integral vertices. Often,…

In this paper, we propose a low-rank coordinate descent approach to structured semidefinite programming with diagonal constraints. The approach, which we call the Mixing method, is extremely simple to implement, has no free parameters, and…

Let $P$ be a bounded convex subset of $\mathbb R^n$ of positive volume. Denote the smallest degree of a polynomial $p(X_1,\dots,X_n)$ vanishing on $P\cap\mathbb Z^n$ by $r_P$ and denote the smallest number $u\geq0$ such that every function…

Let $d \geq 0$ be an integer and let $P \subset \mathbb R^d$ be a $d$-dimensional lattice polytope. We call a polytope $M \subset \mathbb R^d$ such that $M \subset P$ and $M \sim P$ a {\itshape miniature} of $P,$ and it is said to be…