# Extension complexity of (convex) polygons

The extension complexity of a polytope is the minimum number for which there exists a polytope with facets and an affine mapping with .

**Question**Does there exists, for infinitely many integers , a convex polygon on vertices whose extension complexity is ?

The extension complexity of a polytope is bounded from above by its number of vertices. Thus, a convex polygon with vertices has extension complexity .

Some regular convex polygons have extension complexity [BTN].

A convex polygon whose points are drawn randomly on a circle has extension complexity with probability one (follows from [FRT]).

The question asks for the maximal extension complexity of a convex polygon.

A strongly related question is the following.

**Question**What is the extension complexity of an -vertex convex polygon whose vertices are drawn randomly on a circle?

## Bibliography

*[BTN] Ben-Tal, A and Nemirovski, A. On polyhedral approximations of the second-order cone. Math. Oper. Res. 26:2 193-205 (2001)

[FRT] Fiorini, S. and Rothvoss, T. and Tiwary, H.R. Extended formulations of polygons. arXiv:1107.0371

* indicates original appearance(s) of problem.