{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,20]],"date-time":"2026-03-20T15:31:29Z","timestamp":1774020689854,"version":"3.50.1"},"reference-count":38,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2017,3,6]],"date-time":"2017-03-06T00:00:00Z","timestamp":1488758400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2017,3,6]],"date-time":"2017-03-06T00:00:00Z","timestamp":1488758400000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["CCF-1409836"],"award-info":[{"award-number":["CCF-1409836"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["DMS-1418728"],"award-info":[{"award-number":["DMS-1418728"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Math. Program."],"published-print":{"date-parts":[[2018,2]]},"DOI":"10.1007\/s10107-017-1127-6","type":"journal-article","created":{"date-parts":[[2017,3,6]],"date-time":"2017-03-06T16:56:40Z","timestamp":1488819400000},"page":"315-354","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":19,"title":["Symmetric sums of squares over k-subset hypercubes"],"prefix":"10.1007","volume":"167","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-3577-7624","authenticated-orcid":false,"given":"Annie","family":"Raymond","sequence":"first","affiliation":[]},{"given":"James","family":"Saunderson","sequence":"additional","affiliation":[]},{"given":"Mohit","family":"Singh","sequence":"additional","affiliation":[]},{"given":"Rekha R.","family":"Thomas","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2017,3,6]]},"reference":[{"key":"1127_CR1","doi-asserted-by":"publisher","first-page":"331","DOI":"10.1007\/s11081-008-9050-6","volume":"10","author":"Y Bai","year":"2009","unstructured":"Bai, Y., de Klerk, E., Pasechnik, D.V., Sotirov, R.: Exploiting group symmetry in truss topology optimization. Optim. Eng. 10, 331\u2013349 (2009)","journal-title":"Optim. Eng."},{"issue":"1","key":"1127_CR2","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1007\/s00209-016-1644-7","volume":"284","author":"G Blekherman","year":"2016","unstructured":"Blekherman, G., Gouveia, J., Pfeiffer, J.: Sums of squares on the hypercube. Math. Z. 284(1), 41\u201354 (2016)","journal-title":"Math. Z."},{"key":"1127_CR3","doi-asserted-by":"crossref","unstructured":"Bachoc, C., Gijswijt, D.C., Schrijver, A., Vallentin, F.: Invariant semidefinite programs. In: Anjos, M.F., Lasserre, J.B. (eds.) Handbook on Semidefinite, Conic and Polynomial Optimization, volume 166 of International Series on Operation Research and Management Science, pp. 219\u2013269. Springer, New York (2012)","DOI":"10.1007\/978-1-4614-0769-0_9"},{"key":"1127_CR4","volume-title":"Semidefinite Optimization and Convex Algebraic Geometry, volume 13 of MOS-SIAM Series on Optimization","year":"2013","unstructured":"Blekherman, G., Parrilo, P.A., Thomas, R.R. (eds.): Semidefinite Optimization and Convex Algebraic Geometry, volume 13 of MOS-SIAM Series on Optimization. Society for Industrial and Applied Mathematics (SIAM), Philadelphia, PA (2013)"},{"key":"1127_CR5","first-page":"909","volume":"21","author":"C Bachoc","year":"2008","unstructured":"Bachoc, C., Vallentin, F.: New upper bounds for kissing numbers from semidefinite programming. J. AMS 21, 909\u2013924 (2008)","journal-title":"J. AMS"},{"key":"1127_CR6","doi-asserted-by":"publisher","first-page":"189","DOI":"10.1137\/S0895480104442741","volume":"20","author":"E de Klerk","year":"2006","unstructured":"de Klerk, E., Maharry, J., Pasechnik, D.V., Richter, R.B., Salazar, G.: Improved bounds for crossing numbers of $$k_{m, n}$$ and $$k_n$$. SIAM J. Discret. Math. 20, 189\u2013202 (2006)","journal-title":"SIAM J. Discret. Math."},{"key":"1127_CR7","doi-asserted-by":"crossref","unstructured":"de Klerk, E., Pasechnik, D.V.: Solving SDP\u2019s in non-commutative algebras part I: the dual-scaling algorithm. Discussion paper from Tilburg University, Center for Economic Research (2005)","DOI":"10.2139\/ssrn.670151"},{"key":"1127_CR8","doi-asserted-by":"publisher","first-page":"613","DOI":"10.1007\/s10107-006-0039-7","volume":"109","author":"E de Klerk","year":"2007","unstructured":"de Klerk, E., Pasechnik, D.V., Schrijver, A.: Reduction of symmetric semidefinite programs using the regular $$*$$-representation. Math. Program. Ser. B 109, 613\u2013624 (2007)","journal-title":"Math. Program. Ser. B"},{"key":"1127_CR9","doi-asserted-by":"publisher","first-page":"225","DOI":"10.1007\/s10107-008-0246-5","volume":"122","author":"E de Klerk","year":"2010","unstructured":"de Klerk, E., Sotirov, R.: Exploiting group symmetry in semidefinite programming relaxations of the quadratic assignment problem. Math. Program. Ser. A 122, 225\u2013246 (2010)","journal-title":"Math. Program. Ser. A"},{"key":"1127_CR10","series-title":"Number 129 in Graduate Texts in Mathematics","volume-title":"Representation Theory: A First Course","author":"W Fulton","year":"1991","unstructured":"Fulton, W., Harris, J.: Representation Theory: A First Course. Number 129 in Graduate Texts in Mathematics. Springer, Berlin (1991)"},{"issue":"1","key":"1127_CR11","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1017\/S0963548312000508","volume":"22","author":"V Falgas-Ravry","year":"2013","unstructured":"Falgas-Ravry, V., Vaughan, E.R.: Applications of the semi-definite method to the Tur\u00e1n density problem for 3-graphs. Combin. Probab. Comput. 22(1), 21\u201354 (2013)","journal-title":"Combin. Probab. Comput."},{"key":"1127_CR12","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4612-0395-7","volume-title":"Group Theoretical Methods and Their Applications","author":"A F\u00e4ssler","year":"1992","unstructured":"F\u00e4ssler, A., Stiefel, E.: Group Theoretical Methods and Their Applications. Birkh\u00e4user, Basel (1992)"},{"key":"1127_CR13","unstructured":"Gijswijt, D.: Block diagonalization for algebra\u2019s associated with block codes. \n                    arXiv:0910.4515\n                    \n                   (2014)"},{"key":"1127_CR14","doi-asserted-by":"publisher","first-page":"592","DOI":"10.1137\/070683520","volume":"19","author":"N Gvozdenovi\u0107","year":"2008","unstructured":"Gvozdenovi\u0107, N., Laurent, M.: Computing semidefinite programming lower bounds for the (fractional) chromatic number via block-diagonalization. SIAM J. Optim. 19, 592\u2013615 (2008)","journal-title":"SIAM J. Optim."},{"key":"1127_CR15","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1016\/j.orl.2008.10.003","volume":"37","author":"N Gvozdenovi\u0107","year":"2009","unstructured":"Gvozdenovi\u0107, N., Laurent, M., Vallentin, F.: Block-diagonal semidefinite programming hierarchies for 0\/1 programming. Oper. Res. Lett. 37, 27\u201331 (2009)","journal-title":"Oper. Res. Lett."},{"issue":"1\u20133","key":"1127_CR16","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1016\/j.jpaa.2003.12.011","volume":"192","author":"K Gatermann","year":"2004","unstructured":"Gatermann, K., Parrilo, P.A.: Symmetry groups, semidefinite programs, and sums of squares. J. Pure Appl. Algebra 192(1\u20133), 95\u2013128 (2004)","journal-title":"J. Pure Appl. Algebra"},{"issue":"2","key":"1127_CR17","doi-asserted-by":"publisher","first-page":"139","DOI":"10.1007\/s00037-001-8192-0","volume":"10","author":"D Grigoriev","year":"2001","unstructured":"Grigoriev, D.: Complexity of Positivstellensatz proofs for the knapsack. Comput. Complex. 10(2), 139\u2013154 (2001)","journal-title":"Comput. Complex."},{"key":"1127_CR18","unstructured":"Gijswijt, D., Schrijver, A., Tanaka, H.: New upper bounds for nonbinary codes based on the Terwilliger algebra and semidefinite programming. J. Combin. Theory Ser. A 113, 1719\u20131731 (2006)"},{"issue":"2","key":"1127_CR19","doi-asserted-by":"publisher","first-page":"547","DOI":"10.1090\/S0894-0347-2010-00687-X","volume":"24","author":"H Hatami","year":"2011","unstructured":"Hatami, H., Norine, S.: Undecidability of linear inequalities in graph homomorphism densities. J. Am. Math. Soc. 24(2), 547\u2013565 (2011)","journal-title":"J. Am. Math. Soc."},{"key":"1127_CR20","unstructured":"Jansson, L., Lasserre, J.B., Riener, C., Theobald, T.: Exploiting symmetries in SDP-relaxations for polynomial optimization. Math. Oper. Res 38(1), 122\u2013141 (2013)"},{"key":"1127_CR21","doi-asserted-by":"crossref","unstructured":"Kurpisz, A., Lepp\u00e4nen, S., Mastrolilli, M.: Sum-of-squares hierarchy lower bounds for symmetric formulations. In: Louveaux, Q., Skutella, Integer Programming and Combinatorial Optimization, pp. 362\u2013374. Springer, Cham (2016)","DOI":"10.1007\/978-3-319-33461-5_30"},{"key":"1127_CR22","doi-asserted-by":"publisher","first-page":"293","DOI":"10.1023\/A:1015366416311","volume":"2","author":"Y Kanno","year":"2001","unstructured":"Kanno, Y., Ohsaki, M., Murota, K., Katoh, N.: Group symmetry in interior-point methods for semidefinite program. Optim. Eng. 2, 293\u2013320 (2001)","journal-title":"Optim. Eng."},{"key":"1127_CR23","doi-asserted-by":"crossref","unstructured":"K\u00f3vari, T., S\u00f3s, V., Tur\u00e1n, P.: On a problem of K. Zarankiewicz. Colloq Math. 3(1), 50\u201357 (1954)","DOI":"10.4064\/cm-3-1-50-57"},{"issue":"2\u20133","key":"1127_CR24","doi-asserted-by":"publisher","first-page":"239","DOI":"10.1007\/s10107-006-0030-3","volume":"109","author":"M Laurent","year":"2007","unstructured":"Laurent, M.: Strengthened semidefinite bounds for codes. Math. Program. 109(2\u20133), 239\u2013261 (2007)","journal-title":"Math. Program."},{"key":"1127_CR25","doi-asserted-by":"crossref","unstructured":"Laurent, M.: Sums of squares, moment matrices and optimization over polynomials. In: Putinar, M., Sullivant, S. (eds.) Emerging Applications of Algebraic Geometry, volume 149 of IMA Volume in Mathematical Applications, pp. 157\u2013270. Springer, New York (2009)","DOI":"10.1007\/978-0-387-09686-5_7"},{"key":"1127_CR26","volume-title":"Large Networks and Graph Limits, volume 60 of American Mathematical Society Colloquium Publications","author":"L Lov\u00e1sz","year":"2012","unstructured":"Lov\u00e1sz, L.: Large Networks and Graph Limits, volume 60 of American Mathematical Society Colloquium Publications. American Mathematical Society, Providence, RI (2012)"},{"key":"1127_CR27","doi-asserted-by":"crossref","unstructured":"Litjens, B., Polak, S., Schrijver, A.: Semidefinite bounds for nonbinary codes based on quadruples. In: Designs, Codes and Cryptography, pp. 1\u201314. Springer, US (2016)","DOI":"10.1007\/s10623-016-0216-5"},{"key":"1127_CR28","unstructured":"Lee, T., Prakash, A., de\u00a0Wolf, R., Yuen, H.: On the sum-of-squares degree of symmetric quadratic functions. \n                    arXiv:1601.02311\n                    \n                   (2016)"},{"key":"1127_CR29","unstructured":"Parrilo, P.A.: An explicit construction of distinguished representations of polynomials nonnegative over finite sets. Technical Report IfA AUT 02-02, ETH Z\u00fcrich (2002)"},{"key":"1127_CR30","unstructured":"Radziszowski, S.P., et\u00a0al.: Small Ramsey numbers. Electron. J. Combin. 1(7) (1994)"},{"issue":"4","key":"1127_CR31","doi-asserted-by":"publisher","first-page":"1239","DOI":"10.2178\/jsl\/1203350785","volume":"72","author":"AA Razborov","year":"2007","unstructured":"Razborov, A.A.: Flag algebras. J. Symb. Log. 72(4), 1239\u20131282 (2007)","journal-title":"J. Symb. Log."},{"issue":"3","key":"1127_CR32","doi-asserted-by":"publisher","first-page":"946","DOI":"10.1137\/090747476","volume":"24","author":"AA Razborov","year":"2010","unstructured":"Razborov, A.A.: On 3-hypergraphs with forbidden 4-vertex configurations. SIAM J. Discret. Math. 24(3), 946\u2013963 (2010)","journal-title":"SIAM J. Discret. Math."},{"issue":"1\u20132","key":"1127_CR33","doi-asserted-by":"publisher","first-page":"245","DOI":"10.1134\/S000143461401026X","volume":"95","author":"AA Razborov","year":"2014","unstructured":"Razborov, A.A.: On Tur\u00e1n\u2019s (3, 4)-problem with forbidden subgraphs. Math. Notes 95(1\u20132), 245\u2013252 (2014)","journal-title":"Math. Notes"},{"key":"1127_CR34","unstructured":"Raymond, A., Singh, M., Thomas, R.R.: Symmetry in Tur\u00e1n sums of squares polynomials from flag algebras. \n                    arXiv:1507.03059\n                    \n                   (2015)"},{"key":"1127_CR35","volume-title":"The Symmetric Group, volume 203 of Graduate Texts in Mathematics","author":"BE Sagan","year":"2001","unstructured":"Sagan, B.E.: The Symmetric Group, volume 203 of Graduate Texts in Mathematics. Springer, New York (2001). (2nd edn, Representations, Combinatorial Algorithms, and Symmetric Functions)"},{"key":"1127_CR36","unstructured":"Schrijver, A.: Association Schemes and the Shannon Capacity: Eberlein Polynomials and the Erd\u00f6s-Ko\u2013Rado Theorem. Number 25 in Algebraic Methods in Graph Theory, Vol. I, II (Szeged, 1978), Colloqium Mathematical Society. J\u00e1nos Bolyai, North-Holland, Amsterdam (1981)"},{"key":"1127_CR37","doi-asserted-by":"publisher","first-page":"2859","DOI":"10.1109\/TIT.2005.851748","volume":"51","author":"A Schrijver","year":"2005","unstructured":"Schrijver, A.: New code upper bounds from the Terwilliger algebra. IEEE Trans. Inf. Theory 51, 2859\u20132866 (2005)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"1127_CR38","doi-asserted-by":"crossref","unstructured":"Serre, J.-P.: Linear Representations of Finite Groups. Springer, New York. Translated from the second French edition by Leonard L. Scott, Graduate Texts in Mathematics, Vol. 42 (1977)","DOI":"10.1007\/978-1-4684-9458-7"}],"container-title":["Mathematical Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10107-017-1127-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-017-1127-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-017-1127-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,5,16]],"date-time":"2020-05-16T16:25:01Z","timestamp":1589646301000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10107-017-1127-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,3,6]]},"references-count":38,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2018,2]]}},"alternative-id":["1127"],"URL":"https:\/\/doi.org\/10.1007\/s10107-017-1127-6","relation":{},"ISSN":["0025-5610","1436-4646"],"issn-type":[{"value":"0025-5610","type":"print"},{"value":"1436-4646","type":"electronic"}],"subject":[],"published":{"date-parts":[[2017,3,6]]},"assertion":[{"value":"27 June 2016","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"22 February 2017","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"6 March 2017","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}