Symmetry Matters for Sizes of Extended Formulations

Abstract

In 1991, Yannakakis (J. Comput. System Sci., 1991) proved that no symmetric extended formulation for the matching polytope of the complete graph K_n with n nodes has a number of variables and constraints that is bounded subexponentially in n. Here, symmetric means that the formulation remains invariant under all permutations of the nodes of K_n. It was also conjectured in the paper mentioned above that "asymmetry does not help much," but no corresponding result for general extended formulations has been found so far. In this paper we show that for the polytopes associated with the matchings in K_n with log(n) (rounded down) edges there are non-symmetric extended formulations of polynomial size, while nevertheless no symmetric extended formulations of polynomial size exist. We furthermore prove similar statements for the polytopes associated with cycles of length log(n) (rounded down). Thus, with respect to the question for smallest possible extended formulations, in general symmetry requirements may matter a lot. Compared to the extended abtract that has appeared in the Proceedings of IPCO XIV at Lausanne, this paper does not only contain proofs that had been ommitted there, but it also presents slightly generalized and sharpened lower bounds.