Related papers: Complex Free Spectrahedra, Absolute Extreme Points…

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…

For convex and sequential effect algebras, we study spectrality in the sense of Foulis. We show that under additional conditions (strong archimedeanity, closedness in norm and a certain monotonicity property of the sequential product), such…

We prove, under a certain representation theoretic assumption, that the set of real symmetric matrices, whose eigenvalues satisfy a linear matrix inequality, is itself a spectrahedron. The main application is that derivative relaxations of…

We give a complete characterization of the size of Borel sets that are mid-point convex but not (essentially) convex, in terms of their Hausdorff dimensions and Hausdorff measures.

In this paper we demonstrate that there are distinct differences between real and complex equiangular tight frames (ETFs) with regards to erasures. For example, we prove that there exist arbitrarily large non-trivial complex equiangular…

We consider the problem of minimizing a convex function over a subset of R^n that is not necessarily convex (minimization of a convex function over the integer points in a polytope is a special case). We define a family of duals for this…

Folded supersymmetry is a natural theory of the electroweak scale in which the scalar top partner responsible for canceling the ultraviolet sensitivity of the Higgs mass at one loop carries no color. As a result, bounds on naturalness on…

Let $P$ be a convex polyhedron in $\mathbb{R}^3$. The skeleton of $P$ is the graph whose vertices and edges are the vertices and edges of $P$, respectively. We prove that, if these vertices are on the unit-sphere, the skeleton is a $(0.999…

We classify 0-dimensional spectral triples over complex and real algebras and provide some general statements about their differential structure. We investigate also whether such spectral triples admit a symmetry arising from the Hopf…

We characterize the extreme points of the set of incentive-compatible mechanisms for screening problems with linear utility. Our framework subsumes problems with and without transfers, such as monopoly pricing, principal-optimal bilateral…

The celebrated upper bound theorem of McMullen determines the maximal number of extreme points of a polyhedron in terms of its dimension and the number of constraints which define it, showing that the maximum is attained by the polar of the…

We consider the nonconvex set $\mathcal S_n = \{(x,X,z): X = x x^T, \; x (1-z) =0,\; x \geq 0,\; z \in \{0,1\}^n\}$, which is closely related to the feasible region of several difficult nonconvex optimization problems such as the best…

We consider a variation of the classical Erd\H{o}s-Szekeres problems on the existence and number of convex $k$-gons and $k$-holes (empty $k$-gons) in a set of $n$ points in the plane. Allowing the $k$-gons to be non-convex, we show bounds…

A group is properly 3-realizable if it is the fundamental group of a compact polyhedron whose universal covering is proper homotopically equivalent to some 3-manifold. We prove that when such a group is also quasi-simply filtered then it…

Following the work of the first and last authors [2], we further analyze the structure of a zero set of a left ideal in the ring of central polynomials over the quaternion algebra H. We describe the "algebraic hull" of a point in H^n and…

In this work, we reveal a rich combinatorial structure underlying exact minimax optimal algorithms for classical nonexpansive fixed-point problems. This viewpoint unifies all extremal optimal methods and provides a systematic and practical…

Let $S$ be a set of $n$ points in 3-dimensional space. A tetrahedralization $\mathcal{T}$ of $S$ is a set of interior disjoint tetrahedra with vertices on $S$, not containing points of $S$ in their interior, and such that their union is the…

In this paper we study the $C^*$-convex set of unital entanglement breaking (EB-)maps on matrix algebras. General properties and an abstract characterization of $C^*$-extreme points are discussed. By establishing a Radon-Nikodym type…

Given a graph with edges colored red or blue and an integer $k$, the exact perfect matching problem asks if there exists a perfect matching with exactly $k$ red edges. There exists a randomized polylogarithmic-time parallel algorithm to…

A hole is a chordless cycle with at least four vertices. A hole is odd if it has an odd number of vertices. A dart is a graph which vertices $a, b, c, d, e$ and edges $ab, bc, bd, be, cd, de$. Dart-free graphs have been actively studied in…