pith. sign in

arxiv: 1305.3268 · v3 · pith:ZME5XHRKnew · submitted 2013-05-14 · 💻 cs.CC · math.CO

On the existence of 0/1 polytopes with high semidefinite extension complexity

classification 💻 cs.CC math.CO
keywords polytopecomplexityextensionsemidefinitethereexistshighmust
0
0 comments X
read the original abstract

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.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.