5,939 research outputs found
On the existence of 0/1 polytopes with high semidefinite extension complexity
In Rothvo\ss{} it was shown that there exists a 0/1 polytope (a polytope
whose vertices are in \{0,1\}^{n}) such that any higher-dimensional polytope
projecting to it must have 2^{\Omega(n)} facets, i.e., its linear extension
complexity is exponential. The question whether there exists a 0/1 polytope
with high PSD extension complexity was left open. We answer this question in
the affirmative by showing that there is a 0/1 polytope such that any
spectrahedron projecting to it must be the intersection of a semidefinite cone
of dimension~2^{\Omega(n)} and an affine space. Our proof relies on a new
technique to rescale semidefinite factorizations
Hidden Vertices in Extensions of Polytopes
Some widely known compact extended formulations have the property that each
vertex of the corresponding extension polytope is projected onto a vertex of
the target polytope. In this paper, we prove that for heptagons with vertices
in general position none of the minimum size extensions has this property.
Additionally, for any d >= 2 we construct a family of d-polytopes such that at
least 1/9 of all vertices of any of their minimum size extensions is not
projected onto vertices.Comment: 9 pages, to appear in: Operations Research Letter
An upper bound for nonnegative rank
We provide a nontrivial upper bound for the nonnegative rank of rank-three
matrices, which allows us to prove that [6(n+1)/7] linear inequalities suffice
to describe a convex n-gon up to a linear projection
On the Geometric Interpretation of the Nonnegative Rank
The nonnegative rank of a nonnegative matrix is the minimum number of
nonnegative rank-one factors needed to reconstruct it exactly. The problem of
determining this rank and computing the corresponding nonnegative factors is
difficult; however it has many potential applications, e.g., in data mining,
graph theory and computational geometry. In particular, it can be used to
characterize the minimal size of any extended reformulation of a given
combinatorial optimization program. In this paper, we introduce and study a
related quantity, called the restricted nonnegative rank. We show that
computing this quantity is equivalent to a problem in polyhedral combinatorics,
and fully characterize its computational complexity. This in turn sheds new
light on the nonnegative rank problem, and in particular allows us to provide
new improved lower bounds based on its geometric interpretation. We apply these
results to slack matrices and linear Euclidean distance matrices and obtain
counter-examples to two conjectures of Beasly and Laffey, namely we show that
the nonnegative rank of linear Euclidean distance matrices is not necessarily
equal to their dimension, and that the rank of a matrix is not always greater
than the nonnegative rank of its square
Geometric Finite Element Discretization of Maxwell Equations in Primal and Dual Spaces
Based on a geometric discretization scheme for Maxwell equations, we unveil a
mathematical\textit{\}transformation between the electric field intensity
and the magnetic field intensity , denoted as Galerkin duality. Using
Galerkin duality and discrete Hodge operators, we construct two system
matrices, (primal formulation) and (dual
formulation) respectively, that discretize the second-order vector wave
equations. We show that the primal formulation recovers the conventional
(edge-element) finite element method (FEM) and suggests a geometric foundation
for it. On the other hand, the dual formulation suggests a new (dual) type of
FEM. Although both formulations give identical dynamical physical solutions,
the dimensions of the null spaces are different.Comment: 22 pages and 4 figure
On the Geometry of Null Polygons in Full N=4 Superspace
We discuss various formulations of null polygons in full, non-chiral N=4
superspace in terms of spacetime, spinor and twistor variables. We also note
that null polygons are necessarily fat along fermionic directions, a curious
fact which is compensated by suitable equivalence relations in physical
theories on this superspace.Comment: 25 pages, v2: comment on correlation functions adde
Equivariant semidefinite lifts of regular polygons
Given a polytope P in , we say that P has a positive
semidefinite lift (psd lift) of size d if one can express P as the linear
projection of an affine slice of the positive semidefinite cone
. If a polytope P has symmetry, we can consider equivariant psd
lifts, i.e. those psd lifts that respect the symmetry of P. One of the simplest
families of polytopes with interesting symmetries are regular polygons in the
plane, which have played an important role in the study of linear programming
lifts (or extended formulations). In this paper we study equivariant psd lifts
of regular polygons. We first show that the standard Lasserre/sum-of-squares
hierarchy for the regular N-gon requires exactly ceil(N/4) iterations and thus
yields an equivariant psd lift of size linear in N. In contrast we show that
one can construct an equivariant psd lift of the regular 2^n-gon of size 2n-1,
which is exponentially smaller than the psd lift of the sum-of-squares
hierarchy. Our construction relies on finding a sparse sum-of-squares
certificate for the facet-defining inequalities of the regular 2^n-gon, i.e.,
one that only uses a small (logarithmic) number of monomials. Since any
equivariant LP lift of the regular 2^n-gon must have size 2^n, this gives the
first example of a polytope with an exponential gap between sizes of
equivariant LP lifts and equivariant psd lifts. Finally we prove that our
construction is essentially optimal by showing that any equivariant psd lift of
the regular N-gon must have size at least logarithmic in N.Comment: 29 page
- …