# Tropical lower bounds for extended formulations

@article{Shitov2015TropicalLB,
title={Tropical lower bounds for extended formulations},
author={Yaroslav Shitov},
journal={Mathematical Programming},
year={2015},
volume={153},
pages={67-74}
}
• Y. Shitov
• Published 1 October 2015
• Mathematics
• Mathematical Programming
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…
4 Citations

### Extension complexity of low-dimensional polytopes

• Mathematics
ArXiv
• 2020
This paper proves that for a fixed dimension $d$, the extension complexity of a random $d$-dimensional polytope (obtained as the convex hull of random points in a ball or on a sphere) is typically on the order of the square root of its number of vertices.

### Tropical lower bound for extended formulations. II. Deficiency graphs of matrices

• Y. Shitov
• Mathematics
Izvestiya: Mathematics
• 2019
Deficiency graphs arise in the problem of decomposing a tropical vector into a sum of points of a given tropical variety. We give an application of this concept to the theory of extended formulations

### Sublinear extensions of polygons

Every convex polygon with $n$ vertices is a linear projection of a higher-dimensional polytope with at most $147\,n^{2/3}$ facets.