Tropical lower bounds for extended formulations

The tropical arithmetic operations on $$\mathbb {R}$$R, defined as $$\oplus :(a,b)\rightarrow \min \{a,b\}$$⊕:(a,b)→min{a,b} and $$\otimes :(a,b)\rightarrow a+b$$⊗:(a,b)→a+b, arise from studying the geometry over non-Archimedean fields. We present an application of tropical methods to the study of extended formulations for convex polytopes. We propose a non-Archimedean generalization of the well known Boolean rank bound for the extension complexity. We show how to construct a real polytope with the same extension complexity and combinatorial type as a given non-Archimedean polytope. Our results allow us to develop a method of constructing real polytopes with large extension complexity.

[1]  Yaroslav Shitov.  The complexity of tropical matrix factorization , 2012 .

[2]  Dustin Cartwright,et al.  Three notions of tropical rank for symmetric matrices , 2009, Combinatorica.

[3]  Mike Develin.  Tropical Secant Varieties of Linear Spaces , 2006, Discret. Comput. Geom..

[4]  Nicolas Gillis,et al.  On the Geometric Interpretation of the Nonnegative Rank , 2010, 1009.0880.

[5]  F. J. Rayner.  Algebraically Closed Fields Analogous to Fields of Puiseux Series , 1974 .

[6]  Tropical patterns of matrices and the Gondran-Minoux rank function , 2012 .

[7]  Alexander I. Barvinok,et al.  Two Algorithmic Results for the Traveling Salesman Problem , 1996, Math. Oper. Res..

[8]  Hans Raj Tiwary,et al.  Extended Formulations for Polygons , 2011, Discret. Comput. Geom..

[9]  Joel E. Cohen,et al.  Nonnegative ranks, decompositions, and factorizations of nonnegative matrices , 1993 .

[10]  Rekha R. Thomas,et al.  Lifts of Convex Sets and Cone Factorizations , 2011, Math. Oper. Res..

[11]  Yaroslav Shitov.  An upper bound for nonnegative rank , 2014, J. Comb. Theory, Ser. A.

[12]  Erwin Engeler.  Metamathematik der Elementarmathematik , 1983 .

[13]  Y. Shitov.  Studying Non-negative Factorizations with Tools from Linear Algebra over a Semiring , 2015 .

[14]  Sanjeev Arora,et al.  Computing a nonnegative matrix factorization -- provably , 2011, STOC '12.

[15]  Gérard Cornuéjols,et al.  Extended formulations in combinatorial optimization , 2010, 4OR.

[16]  M. Yannakakis.  Expressing combinatorial optimization problems by linear programs , 1991, Symposium on the Theory of Computing.

[17]  Rekha R. Thomas,et al.  Polytopes of Minimum Positive Semidefinite Rank , 2012, Discret. Comput. Geom..

[18]  B. Sturmfels,et al.  On the rank of a tropical matrix , 2003 .