An Algebraic Approach to Symmetric Extended Formulations
Extended formulations are an important tool to obtain small (even compact) formulations of polytopes by representing them as projections of higher dimensional ones. It is an important question whether a polytope admits a small extended formulation, i.e., one involving only a polynomial number of inequalities in its dimension. For the case of symmetric extended formulations (i.e., preserving the symmetries of the polytope) Yannakakis established a powerful technique to derive lower bounds and rule out small formulations. We rephrase the technique of Yannakakis in a group-theoretic framework. This provides a different perspective on symmetric extensions and considerably simplifies several lower bound constructions.
Keywordssymmetric extended formulations polyhedral combinatorics group theory representation theory matching polytope
Unable to display preview. Download preview PDF.
- Dixon, J.D., Mortimer, B.: Permutation groups. Springer (1996) ISBN 0387945997Google Scholar
- Fiorini, S., Kaibel, V., Pashkovich, K., Theis, D.: Combinatorial Bounds on Nonnegative Rank and Extended Formulations. Arxiv preprint arXiv:1111.0444 (2011)Google Scholar
- Fiorini, S., Massar, S., Pokutta, S., Tiwary, H.R., de Wolf, R.: Linear vs. Semidefinite Extended Formulations: Exponential Separation and Strong Lower Bounds. Arxiv preprint arxiv:1111.0837 (2011)Google Scholar
- Goemans, M.X.: Smallest compact formulation for the permutahedron, preprint (2009)Google Scholar
- Kaibel, V.: Extended formulations in combinatorial optimization. Arxiv preprint arXiv:1104.1023 (2011)Google Scholar
- Pashkovich, K.: Symmetry in Extended Formulations of the Permutahedron. Arxiv preprint arXiv:0912.3446 (2009)Google Scholar