{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,9]],"date-time":"2026-04-09T10:05:46Z","timestamp":1775729146709,"version":"3.50.1"},"reference-count":26,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2017,8,31]],"date-time":"2017-08-31T00:00:00Z","timestamp":1504137600000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100001659","name":"Deutsche Forschungsgemeinschaft","doi-asserted-by":"publisher","award":["Research training group \u201cMethods for Discrete Structures\u201d GRK1408"],"award-info":[{"award-number":["Research training group \u201cMethods for Discrete Structures\u201d GRK1408"]}],"id":[{"id":"10.13039\/501100001659","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001659","name":"Deutsche Forschungsgemeinschaft","doi-asserted-by":"publisher","award":["SFB\/TR 109 \u201cDiscretization in Geometry and Dynamics\u201d"],"award-info":[{"award-number":["SFB\/TR 109 \u201cDiscretization in Geometry and Dynamics\u201d"]}],"id":[{"id":"10.13039\/501100001659","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001659","name":"Deutsche Forschungsgemeinschaft","doi-asserted-by":"publisher","award":["SFB\/TR 109 \u201cDiscretization in Geometry and Dynamics\u201d"],"award-info":[{"award-number":["SFB\/TR 109 \u201cDiscretization in Geometry and Dynamics\u201d"]}],"id":[{"id":"10.13039\/501100001659","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Institut national des sciences math\u00e9matiques et de leurs interactions (INSMI), Centre national de la recherche scientifique (CNRS)","award":["PEPS Jeunes Chercheur-e-s 2016"],"award-info":[{"award-number":["PEPS Jeunes Chercheur-e-s 2016"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Discrete Comput Geom"],"published-print":{"date-parts":[[2018,4]]},"DOI":"10.1007\/s00454-017-9925-4","type":"journal-article","created":{"date-parts":[[2017,8,31]],"date-time":"2017-08-31T13:13:45Z","timestamp":1504185225000},"page":"621-642","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["Extension Complexity and Realization Spaces of Hypersimplices"],"prefix":"10.1007","volume":"59","author":[{"given":"Francesco","family":"Grande","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4747-2729","authenticated-orcid":false,"given":"Arnau","family":"Padrol","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Raman","family":"Sanyal","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2017,8,31]]},"reference":[{"key":"9925_CR1","doi-asserted-by":"crossref","first-page":"299","DOI":"10.2140\/pjm.1970.32.299","volume":"32","author":"D Barnette","year":"1970","unstructured":"Barnette, D., Gr\u00fcnbaum, B.: Preassigning the shape of a face. Pac. J. Math. 32, 299\u2013306 (1970)","journal-title":"Pac. J. Math."},{"issue":"2","key":"9925_CR2","first-page":"127","volume":"3","author":"LB Beasley","year":"2013","unstructured":"Beasley, L.B., Klauck, H., Lee, T., Theis, D.O.: Communication complexity, linear optimization, and lower bounds for the nonnegative rank of matrices (Dagstuhl Seminar 13082). Dagstuhl Rep. 3(2), 127\u2013143 (2013)","journal-title":"Dagstuhl Rep."},{"key":"9925_CR3","unstructured":"Belov, A., Heule, M.J.H., J\u00e4rvisalo, M.: Proceedings of SAT Competition 2014. Department of Computer Science Series of Publications B, vol. B-2014-2. University of Helsinki, Helsinki (2014). http:\/\/fmv.jku.at\/lingeling"},{"key":"9925_CR4","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511586507","volume-title":"Oriented Matroids. Encyclopedia of Mathematics and Its Applications","author":"A Bj\u00f6rner","year":"1999","unstructured":"Bj\u00f6rner, A., Las Vergnas, M., Sturmfels, B., White, N., Ziegler, G.M.: Oriented Matroids. Encyclopedia of Mathematics and Its Applications, vol. 46, 2nd edn. Cambridge University Press, Cambridge (1999)","edition":"2"},{"key":"9925_CR5","doi-asserted-by":"crossref","unstructured":"Fiorini, S., Kaibel, V., Pashkovich, K., Theis, D.O.: Combinatorial bounds on nonnegative rank and extended formulations. Discrete Math. 313(1), 67\u201383 (2013)","DOI":"10.1016\/j.disc.2012.09.015"},{"issue":"2","key":"9925_CR6","doi-asserted-by":"crossref","first-page":"17","DOI":"10.1145\/2716307","volume":"62","author":"S Fiorini","year":"2015","unstructured":"Fiorini, S., Massar, S., Pokutta, S., Tiwary, H.R., de Wolf, R.: Exponential lower bounds for polytopes in combinatorial optimization. J. ACM 62(2), 17 (2015)","journal-title":"J. ACM"},{"issue":"3","key":"9925_CR7","doi-asserted-by":"crossref","first-page":"658","DOI":"10.1007\/s00454-012-9421-9","volume":"48","author":"S Fiorini","year":"2012","unstructured":"Fiorini, S., Rothvo\u00df, T., Tiwary, H.R.: Extended formulations for polygons. Discrete Comput. Geom. 48(3), 658\u2013668 (2012)","journal-title":"Discrete Comput. Geom."},{"key":"9925_CR8","series-title":"DMV Seminar","doi-asserted-by":"crossref","first-page":"43","DOI":"10.1007\/978-3-0348-8438-9_2","volume-title":"Polytopes\u2014Combinatorics and Computation","author":"E Gawrilow","year":"2000","unstructured":"Gawrilow, E., Joswig, M.: Polymake: a framework for analyzing convex polytopes. In: Kalai, G., Ziegler, G.M. (eds.) Polytopes\u2014Combinatorics and Computation. DMV Seminar, vol. 29, pp. 43\u201374. Birkh\u00e4user, Basel (2000)"},{"issue":"3","key":"9925_CR9","doi-asserted-by":"crossref","first-page":"301","DOI":"10.1016\/0001-8708(87)90059-4","volume":"63","author":"IM Gel\u2019fand","year":"1987","unstructured":"Gel\u2019fand, I.M., Goresky, R.M., MacPherson, R.D., Serganova, V.V.: Combinatorial geometries, convex polyhedra, and Schubert cells. Adv. Math. 63(3), 301\u2013316 (1987)","journal-title":"Adv. Math."},{"issue":"3","key":"9925_CR10","doi-asserted-by":"crossref","first-page":"679","DOI":"10.1007\/s00454-013-9533-x","volume":"50","author":"J Gouveia","year":"2013","unstructured":"Gouveia, J., Robinson, R.Z., Thomas, R.R.: Polytopes of minimum positive semidefinite rank. Discrete Comput. Geom. 50(3), 679\u2013699 (2013)","journal-title":"Discrete Comput. Geom."},{"key":"9925_CR11","series-title":"Graduate Texts in Mathematics","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4613-0019-9","volume-title":"Convex Polytopes","author":"B Gr\u00fcnbaum","year":"2003","unstructured":"Gr\u00fcnbaum, B.: Convex Polytopes. Graduate Texts in Mathematics, vol. 221, 2nd edn. Springer, New York (2003)","edition":"2"},{"key":"9925_CR12","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/j.jctb.2016.11.002","volume":"123","author":"F Grande","year":"2017","unstructured":"Grande, F., Sanyal, R.: Theta rank, levelness, and matroid minors. J. Comb. Theory Ser. B 123, 1\u201331 (2017)","journal-title":"J. Comb. Theory Ser. B"},{"issue":"2","key":"9925_CR13","first-page":"109","volume":"5","author":"H Klauck","year":"2015","unstructured":"Klauck, H., Lee, T., Theis, D.O., Thomas, R.R.: Limitations of convex programming: lower bounds on extended formulations and factorization ranks (Dagstuhl Seminar 15082). Dagstuhl Rep. 5(2), 109\u2013127 (2015)","journal-title":"Dagstuhl Rep."},{"issue":"2","key":"9925_CR14","doi-asserted-by":"crossref","first-page":"396","DOI":"10.1007\/s00454-014-9655-9","volume":"53","author":"V Kaibel","year":"2015","unstructured":"Kaibel, V., Weltge, S.: A short proof that the extension complexity of the correlation polytope grows exponentially. Discrete Comput. Geom. 53(2), 396\u2013401 (2015)","journal-title":"Discrete Comput. Geom."},{"key":"9925_CR15","series-title":"Lecture Notes in Mathematics","doi-asserted-by":"crossref","first-page":"527","DOI":"10.1007\/BFb0082792","volume-title":"Topology and Geometry\u2014Rohlin Seminar","author":"NE Mn\u00ebv","year":"1988","unstructured":"Mn\u00ebv, N.E.: The universality theorems on the classification problem of configuration varieties and convex polytopes varieties. In: Viro, O.Y., Vershik, A.M. (eds.) Topology and Geometry\u2014Rohlin Seminar. Lecture Notes in Mathematics, vol. 1346, pp. 527\u2013543. Springer, Berlin (1988)"},{"key":"9925_CR16","unstructured":"Oelze, M., Vandaele, A., Weltge, S.: Computing the extension complexities of all 4-dimensional 0\/1-polytopes. http:\/\/arxiv.org\/abs\/1406.4895 (2014)"},{"key":"9925_CR17","series-title":"Oxford Graduate Texts in Mathematics","doi-asserted-by":"crossref","DOI":"10.1093\/acprof:oso\/9780198566946.001.0001","volume-title":"Matroid Theory","author":"JG Oxley","year":"2011","unstructured":"Oxley, J.G.: Matroid Theory. Oxford Graduate Texts in Mathematics, vol. 21, 2nd edn. Oxford University Press, Oxford (2011)","edition":"2"},{"issue":"4","key":"9925_CR18","doi-asserted-by":"crossref","first-page":"2162","DOI":"10.1137\/16M1063721","volume":"30","author":"A Padrol","year":"2016","unstructured":"Padrol, A.: Extension complexity of polytopes with few vertices or facets. SIAM J. Discrete Math. 30(4), 2162\u20132176 (2016)","journal-title":"SIAM J. Discrete Math."},{"issue":"1","key":"9925_CR19","first-page":"1.24-1","volume":"22","author":"A Padrol","year":"2015","unstructured":"Padrol, A., Pfeifle, J.: Polygons as sections of higher-dimensional polytopes. Electron. J. Comb. 22(1), 1.24-1\u20131.24-16 (2015)","journal-title":"Electron. J. Comb."},{"key":"9925_CR20","series-title":"Lecture Notes in Mathematics","doi-asserted-by":"crossref","DOI":"10.1007\/BFb0093761","volume-title":"Realization Spaces of Polytopes","author":"J Richter-Gebert","year":"1996","unstructured":"Richter-Gebert, J.: Realization Spaces of Polytopes. Lecture Notes in Mathematics, vol. 1643. Springer, Berlin (1996)"},{"key":"9925_CR21","doi-asserted-by":"crossref","unstructured":"Rothvo\u00df, T.: Some 0\/1 polytopes need exponential size extended formulations. Math. Program. 142(1\u20132), 255\u2013268 (2013)","DOI":"10.1007\/s10107-012-0574-3"},{"key":"9925_CR22","doi-asserted-by":"crossref","unstructured":"Rothvo\u00df, T.: The matching polytope has exponential extension complexity. In: Proceedings of the 46th Annual ACM Symposium on Theory of Computing (STOC\u201914), pp. 263\u2013272. ACM, New York (2014)","DOI":"10.1145\/2591796.2591834"},{"key":"9925_CR23","unstructured":"Shitov, Ya.: Sublinear extensions of polygons. http:\/\/arxiv.org\/abs\/1412.0728 (2014)"},{"key":"9925_CR24","doi-asserted-by":"crossref","unstructured":"Shitov, Ya.: An upper bound for nonnegative rank. J. Comb. Theory Ser. A 122, 126\u2013132 (2014)","DOI":"10.1016\/j.jcta.2013.10.004"},{"key":"9925_CR25","doi-asserted-by":"crossref","unstructured":"Wheeler, A.K.: Ideals generated by principal minors. http:\/\/arxiv.org\/abs\/1410.1910 (2015)","DOI":"10.1215\/ijm\/1475266403"},{"key":"9925_CR26","series-title":"Graduate Texts in Mathemtaics","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4613-8431-1","volume-title":"Lectures on Polytopes","author":"GM Ziegler","year":"1995","unstructured":"Ziegler, G.M.: Lectures on Polytopes. Graduate Texts in Mathemtaics, vol. 152. Springer, New York (1995)"}],"container-title":["Discrete & Computational Geometry"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00454-017-9925-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00454-017-9925-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00454-017-9925-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,8,25]],"date-time":"2023-08-25T10:23:49Z","timestamp":1692959029000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00454-017-9925-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,8,31]]},"references-count":26,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2018,4]]}},"alternative-id":["9925"],"URL":"https:\/\/doi.org\/10.1007\/s00454-017-9925-4","relation":{},"ISSN":["0179-5376","1432-0444"],"issn-type":[{"value":"0179-5376","type":"print"},{"value":"1432-0444","type":"electronic"}],"subject":[],"published":{"date-parts":[[2017,8,31]]}}}