A Short Proof that the Extension Complexity of the Correlation Polytope Grows Exponentially
- 287 Downloads
We establish that the extension complexity of the \(n\times n\) correlation polytope is at least \(1.5\,^n\) by a short proof that is self-contained except for using the fact that every face of a polyhedron is the intersection of all facets it is contained in. The main innovative aspect of the proof is a simple combinatorial argument showing that the rectangle covering number of the unique-disjointness matrix is at least \(1.5^n\), and thus the nondeterministic communication complexity of the unique-disjointness predicate is at least \(.58n\). We thereby slightly improve on the previously best known lower bounds \(1.24^n\) and \(.31n\), respectively.
KeywordsCorrelation polytope Extended formulations Unique disjointness Communication complexity
Mathematics Subject Classification52Bxx 90C57 94Axx
We thank Yuri Faenza and Kanstantsin Pashkovich for their helpful remarks on an earlier version of this paper. Part of this research was funded by the German Research Foundation (DFG): “Extended Formulations in Combinatorial Optimization” (KA 1616/4-1).
- 2.Braun, G., Pokutta, S.: Common information and unique disjointness. In: Foundations of Computer Science (FOCS), IEEE 54th Annual Symposium, pp. 688–697 (2013)Google Scholar
- 3.Fiorini, S., Massar, S., Pokutta, S., Tiwary, H.R., de Wolf, R.: Linear vs. semidefinite extended formulations: exponential separation and strong lower bounds. In: STOC, pp. 95–106 (2012)Google Scholar
- 5.Kushilevitz, E., Nisan, N.: Communication Complexity. Cambridge University Press, Cambridge (2006)Google Scholar
- 8.Rothvoß, T.: The matching polytope has exponential extension complexity. http://arxiv.org/abs/1311.2369 (2013)