Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
167 tokens/sec
GPT-4o
7 tokens/sec
Gemini 2.5 Pro Pro
42 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

On the existence of 0/1 polytopes with high semidefinite extension complexity (1305.3268v3)

Published 14 May 2013 in cs.CC and math.CO

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.

Citations (43)

Summary

We haven't generated a summary for this paper yet.