Related papers: Self-dual polyhedral cones and their slack matrice…
In this paper, we determine the automorphism group of the $p$-cones ($p\neq 2$) in dimension greater than two. In particular, we show that the automorphism group of those $p$-cones are the positive scalar multiples of the generalized…
We prove that a holomorphic line bundle on a projective manifold is pseudo-effective if and only if its degree on any member of a covering family of curves is non-negative. This is a consequence of a duality statement between the cone of…
Using elementary duality properties of positive semidefinite moment matrices and polynomial sum-of-squares decompositions, we prove that the convex hull of rationally parameterized algebraic varieties is semidefinite representable (that is,…
Given a proper cone $K$ in the Euclidean space $\mathbb{R}^n$, a square matrix $A$ is said to be $K$-semipositive if there exists an $x\in K$ such that $Ax\in \text{int}(K)$, the topological interior of $K$. The paper aims to study…
A matrix convex set is a set of the form $\mathcal{S} = \cup_{n\geq 1}\mathcal{S}_n$ (where each $\mathcal{S}_n$ is a set of $d$-tuples of $n \times n$ matrices) that is invariant under UCP maps from $M_n$ to $M_k$ and under formation of…
Semidefinite programming (SDP) is the task of optimizing a linear function over the common solution set of finitely many linear matrix inequalities (LMIs). For the running time of SDP solvers, the maximal matrix size of these LMIs is…
The set of matrices of given positive semidefinite rank is semialgebraic. In this paper we study the geometry of this set, and in small cases we describe its boundary. For general values of positive semidefinite rank we provide a conjecture…
The double cone, a cone over a product of a pair of spheres, is known to play a role in the black-hole black-string phase diagram, and like all cones it is continuously self similar (CSS). Its zero modes spectrum (in a certain sector) is…
In this paper we introduce a new dual program, which is representable as a semi-definite linear programming problem, for a primal convex minimax programming model problem and show that there is no duality gap between the primal and the dual…
It is well-known that the convex and concave envelope of a multilinear polynomial over a box are polyhedral functions. Exponential-sized extended and projected formulations for these envelopes are also known. We consider the convexification…
The extension complexity of a polytope measures its amenability to succinct representations via lifts. There are several versions of extension complexity, including linear, real semidefinite, and complex semidefinite. We focus on the last…
The concept of double nonnegativity of matrices is generalized to doubly nonnegative tensors by means of the nonnegativity of all entries and $H$-eigenvalues. This generalization is defined for tensors of any order (even or odd), while it…
Smooth planar vector fields containing two hyperbolic saddles may possess contours formed by heteroclinic connections between these saddles. We present an overview of the bifurcations of these contours based on papers by J.W. Reyn and A.V.…
Let $X^{(2)}$ denote the second symmetric product space of a partially ordered vector space $X$, endowed with the projective cone. A characterization of linear maps $T\colon X^{(2)}\to X^{(2)}$ which preserve the set of all positive…
For every proper convex cone $K \subset \mathbb R^3$ there exists a unique complete hyperbolic affine 2-sphere with mean curvature $-1$ which is asymptotic to the boundary of the cone. Two cones are associated if the corresponding affine…
This is the first of two papers concerning saddle-shaped solutions to the semilinear equation $L_K u = f(u)$ in $\mathbb{R}^{2m}$, where $L_K$ is a linear elliptic integro-differential operator and $f$ is of Allen-Cahn type. Saddle-shaped…
Recently, there has been interest in the question of whether a partial matrix in which many of the fully defined principal submatrices are PSD is approximately PSD completable. These questions are related to graph theory because we can…
We study connections between self-inversive and self-reciprocal polynomials, reduction theory of binary forms, minimal models of curves, and formally self-dual codes. We prove that if $\mathcal X$ is a superelliptic curve defined over…
Quadratically constrained quadratic programs (QCQPs) are a fundamental class of optimization problems well-known to be NP-hard in general. In this paper we study sufficient conditions for a convex hull result that immediately implies that…
Optical properties of nonmagnetic structures that support artificial optically-induced magnetic responses have recently attracted surging interest. Here we conduct symmetry-dictated investigations into scattering properties of nonmagnetic…