The Extension Complexity of Polytopes with Bounded Integral Slack Matrices
Pages 113 - 123
Abstract
We show that any bounded integral function with rank r has deterministic communication complexity , where the rank of f is defined to be the rank of the matrix whose entries are the function values. As a corollary, we show that any n-dimensional polytope that admits a slack matrix with entries from has extension complexity at most .
References
[1]
Barvinok, A.: Approximations of convex bodies by polytopes and by projections of spectrahedra. arXiv preprint: arXiv:1204.0471 (2012)
[2]
Conforti M, Cornuéjols G, and Zambelli G Extended formulations in combinatorial optimization 4OR 2010 8 1 1-48
[3]
Fawzi H, Gouveia J, Parrilo PA, Robinson RZ, and Thomas RR Positive semidefinite rank Math. Program. 2015 153 133-177
[4]
Fiorini S, Massar S, Pokutta S, Tiwary HR, and De Wolf R Exponential lower bounds for polytopes in combinatorial optimization J. ACM (JACM) 2015 62 2 1-23
[5]
Linial N, Mendelson S, Schechtman G, and Shraibman A Complexity measures of sign matrices Combinatorica 2007 27 439-463
[6]
Lovász, L., Saks, M.: Lattices, mobius functions and communications complexity. In: 29th Annual Symposium on Foundations of Computer Science, pp. 81–90. IEEE Computer Society (1988)
[7]
Lovett S Communication is bounded by root of rank J. (JACM) 2016 63 1 1-9
[8]
Nisan N and Wigderson A On rank vs. communication complexity Combinatorica 1995 15 4 557-565
[9]
Rao A and Yehudayoff A Communication Complexity and Applications 2020 Cambridge Cambridge University Press
[10]
Rothvoß, T.: A direct proof for Lovett’s bound on the communication complexity of low rank matrices. arXiv preprint: arXiv:1409.6366 (2014)
[11]
Rothvoß T The matching polytope has exponential extension complexity J. ACM (JACM) 2017 64 6 1-19
[12]
Yannakakis, M.: Expressing combinatorial optimization problems by linear programs. In: Proceedings of the Twentieth Annual ACM Symposium on Theory of Computing, pp. 223–228 (1988)
Recommendations
Limitations of the hyperplane separation technique for bounding the extension complexity of polytopes
AbstractThe hyperplane separation bound is a lower bound on the extension complexity of a polytope. It is the main tool in Rothvoß's proof of an exponential bound for the matching polytope (Rothvoß, 2017). We show that the technique is ...
Slack matrices, k-products, and 2-level polytopes
AbstractIn this paper, we study algorithmic questions concerning products of matrices and their consequences for recognition algorithms for polyhedra.
The 1-product of matrices S 1 ∈ R m 1 × n 1 , S 2 ∈ R m 2 × n 2 is a matrix in R ( m 1 + m 2 ) × ( n 1 ...
A geometric lower bound on the extension complexity of polytopes based on the f-vector
AbstractA linear extension of a polytope Q is any polytope which can be mapped onto Q via an affine transformation. The extension complexity of a polytope is the minimum number of facets of any linear extension of this polytope. In general, ...
Comments
Information & Contributors
Information
Published In
Jul 2024
473 pages
© The Author(s), under exclusive license to Springer Nature Switzerland AG 2024.
Publisher
Springer-Verlag
Berlin, Heidelberg
Publication History
Published: 03 July 2024
Author Tags
Qualifiers
- Article
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- 0Total Citations
- 0Total Downloads
- Downloads (Last 12 months)0
- Downloads (Last 6 weeks)0
Reflects downloads up to 16 Feb 2025