{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,5]],"date-time":"2026-06-05T07:09:39Z","timestamp":1780643379367,"version":"3.54.1"},"reference-count":52,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2022,7,23]],"date-time":"2022-07-23T00:00:00Z","timestamp":1658534400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2022,7,23]],"date-time":"2022-07-23T00:00:00Z","timestamp":1658534400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Math. Program."],"published-print":{"date-parts":[[2023,7]]},"DOI":"10.1007\/s10107-022-01861-0","type":"journal-article","created":{"date-parts":[[2022,7,23]],"date-time":"2022-07-23T16:02:23Z","timestamp":1658592143000},"page":"703-737","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":7,"title":["Graphical designs and gale duality"],"prefix":"10.1007","volume":"200","author":[{"given":"Catherine","family":"Babecki","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-2189-2303","authenticated-orcid":false,"given":"Rekha R.","family":"Thomas","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2022,7,23]]},"reference":[{"issue":"14","key":"1861_CR1","doi-asserted-by":"publisher","first-page":"3775","DOI":"10.1109\/TSP.2016.2546233","volume":"64","author":"A Anis","year":"2016","unstructured":"Anis, A., Gadde, A., Ortega, A.: Effcient sampling set selection for bandlimited graph signals using graph spectral proxies. IEEE Trans. on Signal Process., a Publication of the IEEE Signal Process. Soci. 64(14), 3775\u20133789 (2016)","journal-title":"IEEE Trans. on Signal Process., a Publication of the IEEE Signal Process. Soci."},{"issue":"1","key":"1861_CR2","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1016\/0095-8956(85)90092-9","volume":"38","author":"N Alon","year":"1985","unstructured":"Alon, N., Milman, V.D.: $$\\lambda $$1, Isoperimetric inequalities for graphs, and superconcentrators. J. of Comb. Theory 38(1), 73\u201388 (1985)","journal-title":"J. of Comb. Theory"},{"issue":"81","key":"1861_CR3","first-page":"1","volume":"27","author":"C Babecki","year":"2021","unstructured":"Babecki, C.: Cubes, codes, and graphical designs. J. Fourier Anal. Appl. 27(81), 1\u201334 (2021)","journal-title":"J. Fourier Anal. Appl."},{"key":"1861_CR4","doi-asserted-by":"publisher","first-page":"2419","DOI":"10.1109\/TSP.2020.2981202","volume":"68","author":"Y Bai","year":"2020","unstructured":"Bai, Y., et al.: Fast graph sampling set selection using Gershgorin disc alignment. IEEE Trans. on Signal Process. 68, 2419\u20132434 (2020)","journal-title":"IEEE Trans. on Signal Process."},{"key":"1861_CR5","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4614-1939-6","volume-title":"Spectra of Graphs","author":"AE Brouwer","year":"2012","unstructured":"Brouwer, A.E., Haemers, W.H.: Spectra of Graphs. Springer, New York, NY (2012)"},{"key":"1861_CR6","doi-asserted-by":"crossref","unstructured":"Burago, D., Ivanov, S., Kurylev, Y.: A graph discretization of the Laplace-Beltrami operator. In: Journal of Spectral Theory. 4 (2013)","DOI":"10.4171\/JST\/83"},{"key":"1861_CR7","volume-title":"The Mathematical Theory of Coding","author":"IF Blake","year":"1975","unstructured":"Blake, I.F., Mullin, R.C.: The Mathematical Theory of Coding. Academic Press Inc, New York (1975)"},{"key":"1861_CR8","first-page":"181","volume":"18","author":"A Bonisoli","year":"1984","unstructured":"Bonisoli, A.: Every equidistant linear code is a sequence of dual Hamming codes. Ars Combin. 18, 181\u2013186 (1984)","journal-title":"Ars Combin."},{"issue":"1","key":"1861_CR9","doi-asserted-by":"publisher","first-page":"193","DOI":"10.1007\/BF03014795","volume":"32","author":"C Caratheodory","year":"1911","unstructured":"Caratheodory, C.: \u00dcber den Variabilit\u00e4tsbereich der Fourier\u2019schen Konstanten von positiven harmonischen Funktionen. : Rendiconti del Circolo Matematico di Palermn. 32(1), 193\u2013217 (1911). (in German)","journal-title":": Rendiconti del Circolo Matematico di Palermn."},{"key":"1861_CR10","doi-asserted-by":"crossref","unstructured":"Chan, A., Godsil, C.D.: Symmetry and eigenvectors. In: Graph Symmetry (Montreal, PQ, 1996). Vol. 497. NATO Adv. Sci. Inst. Ser. C: Math. Phys. Sci. pp. 75\u2013106. Kluwer Acad. Publ., Dordrecht (1997)","DOI":"10.1007\/978-94-015-8937-6_3"},{"issue":"24","key":"1861_CR11","doi-asserted-by":"publisher","first-page":"6510","DOI":"10.1109\/TSP.2015.2469645","volume":"63","author":"S Chen","year":"2015","unstructured":"Chen, S., et al.: Discrete signal processing on graphs: sampling theory. IEEE Trans. on Signal Process. 63(24), 6510\u20136523 (2015)","journal-title":"IEEE Trans. on Signal Process."},{"key":"1861_CR12","unstructured":"Delsarte, P.: An Algebraic Approach to the Association Schemes of Coding Theory. Philips Res. Repts Suppl. 10, (1973)"},{"key":"1861_CR13","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-04295-9","volume-title":"Geometry of Cuts and Metrics. Vol. 15 Algorithms and Combinatorics","author":"MM Deza","year":"1997","unstructured":"Deza, M.M., Laurent, M.: Geometry of Cuts and Metrics. Vol. 15 Algorithms and Combinatorics. Springer-Verlag, Berlin (1997)"},{"key":"1861_CR14","doi-asserted-by":"crossref","unstructured":"Gale, D.: Neighboring vertices on a convex polyhedron. In: Linear Inequalities and Related System. Annals of Mathematics Studies, no. 38. Princeton University Press, Princeton, N.J., pp. 255\u2013263 (1956)","DOI":"10.1515\/9781400881987-016"},{"key":"1861_CR15","doi-asserted-by":"crossref","unstructured":"Gawrilow, E., Joswig, M.: polymake: A framework for analyzing convex polytopes. In: Polytopes|Combinatorics and Computation (Ober-wolfach, 1997). Vol. 29. DMV Sem. pp. 43\u201373. Birkh\u00e4user, Basel (2000)","DOI":"10.1007\/978-3-0348-8438-9_2"},{"key":"1861_CR16","doi-asserted-by":"crossref","unstructured":"Godsil, C.D.: Graphs, groups and polytopes. In: Combinatorial Mathematics (Proc. Internat. Conf. Combinatorial Theory, Australian Nat. Univ., Canberra, 1977). Vol. 686. Lecture Notes in Math. pp. 157\u2013164. Springer, Berlin (1978)","DOI":"10.1007\/BFb0062528"},{"key":"1861_CR17","doi-asserted-by":"crossref","unstructured":"Godsil, C.D.: Euclidean geometry of distance regular graphs. In: Surveys in Combinatorics, (Stirling). Vol. 218. London Math. Soc. Lecture Note Ser. pp. 1\u201323. Cambridge Univ. Press, Cambridge (1995)","DOI":"10.1017\/CBO9780511662096.002"},{"issue":"4","key":"1861_CR18","doi-asserted-by":"publisher","first-page":"739","DOI":"10.4153\/CJM-1998-040-8","volume":"50","author":"CD Godsil","year":"1998","unstructured":"Godsil, C.D.: Eigenpolytopes of distance regular graphs. Canad. J. Math. 50(4), 739\u2013755 (1998)","journal-title":"Canad. J. Math."},{"key":"1861_CR19","doi-asserted-by":"publisher","first-page":"490","DOI":"10.1016\/j.laa.2020.07.012","volume":"604","author":"K Golubev","year":"2020","unstructured":"Golubev, K.: Graphical designs and extremal combinatorics. Linear Algebra and its Appl. 604, 490\u2013506 (2020)","journal-title":"Linear Algebra and its Appl."},{"key":"1861_CR20","volume-title":"Convex Polytopes. Second. Vol. 221. Graduate Texts in Mathematics","author":"B Gr\u00fcnbaum","year":"2003","unstructured":"Gr\u00fcnbaum, B.: Convex Polytopes. Second. Vol. 221. Graduate Texts in Mathematics. Springer-Verlag, New York (2003)"},{"key":"1861_CR21","unstructured":"Haemers, W.H.: Hoffman\u2019s ratio bound. (2021). arXiv: 2102.05529"},{"key":"1861_CR22","unstructured":"Hein, M., Audibert, J.-Y., von Luxburg, U.: Graph Laplacians and their convergence on random neighborhood graphs. Journal of Machine Learning Reseach. 8 (2007)"},{"issue":"2","key":"1861_CR23","doi-asserted-by":"publisher","first-page":"147","DOI":"10.1002\/j.1538-7305.1950.tb00463.x","volume":"29","author":"RW Hamming","year":"1950","unstructured":"Hamming, R.W.: Error detecting and error correcting codes. The Bell Syst. Technical J. 29(2), 147\u2013160 (1950)","journal-title":"The Bell Syst. Technical J."},{"key":"1861_CR24","unstructured":"Hoffman, A.J.: On eigenvalues and colorings of graphs. In: Graph Theory and Its Applications. Ed. by B. Harris. (1970)"},{"issue":"2","key":"1861_CR25","doi-asserted-by":"publisher","first-page":"933","DOI":"10.1016\/j.cam.2009.05.018","volume":"231","author":"D Huybrechs","year":"2009","unstructured":"Huybrechs, D.: Stable high-order quadrature rules with equidistant points. J. of Comput. and Appl. Math. 231(2), 933\u2013947 (2009)","journal-title":"J. of Comput. and Appl. Math."},{"issue":"2","key":"1861_CR26","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1016\/j.acha.2010.04.005","volume":"30","author":"PK Hammond","year":"2011","unstructured":"Hammond, P.K., Vandergheynst, P., Gribonval, R.: Wavelets on graphs via spectral graph theory. Appl. and Comput. Harmonic Anal. 30(2), 129\u2013150 (2011)","journal-title":"Appl. and Comput. Harmonic Anal."},{"issue":"324","key":"1861_CR27","doi-asserted-by":"publisher","first-page":"1933","DOI":"10.1090\/mcom\/3515","volume":"89","author":"GC Linderman","year":"2020","unstructured":"Linderman, G.C., Steinerberger, S.: Numerical integration on graphs: where to sample and how to weigh. Math. of Comput. 89(324), 1933\u20131952 (2020)","journal-title":"Math. of Comput."},{"issue":"7","key":"1861_CR28","doi-asserted-by":"publisher","first-page":"1832","DOI":"10.1109\/TSP.2015.2507546","volume":"64","author":"AG Marques","year":"2016","unstructured":"Marques, A.G., et al.: Sampling of graph signals With successive local aggregations. IEEE Trans. on Signal Process. 64(7), 1832\u20131843 (2016)","journal-title":"IEEE Trans. on Signal Process."},{"key":"1861_CR29","unstructured":"MATLAB. version 9.9.0 (R2020b). Natick, Massachusetts: The Math-Works Inc., (2020)"},{"key":"1861_CR30","unstructured":"McConnell, B.D.S.: Spectral realizations of graphs. (2020). https:\/\/daylateanddollarshort.com\/mathdocs\/Spectral-Realizations-of-Graphs.pdf"},{"issue":"2","key":"1861_CR31","doi-asserted-by":"publisher","first-page":"179","DOI":"10.1112\/S0025579300002850","volume":"17","author":"P McMullen","year":"1970","unstructured":"McMullen, P.: The maximum numbers of faces of a convex polytope. Mathematika 17(2), 179\u2013184 (1970)","journal-title":"Mathematika"},{"issue":"5","key":"1861_CR32","doi-asserted-by":"publisher","first-page":"808","DOI":"10.1109\/JPROC.2018.2820126","volume":"106","author":"A Ortega","year":"2018","unstructured":"Ortega, A., et al.: Graph signal processing: overview, challenges, and applications. Proc. of the IEEE. 106(5), 808\u2013828 (2018)","journal-title":"Proc. of the IEEE."},{"key":"1861_CR33","doi-asserted-by":"crossref","unstructured":"Ortega, A.: Introduction to Graph Signal Processing. Cambridge University Press, Cambridge, UK (2022)","DOI":"10.1017\/9781108552349"},{"issue":"10","key":"1861_CR34","doi-asserted-by":"publisher","first-page":"5603","DOI":"10.1090\/S0002-9947-08-04511-X","volume":"360","author":"IZ Pesenson","year":"2008","unstructured":"Pesenson, I.Z.: Sampling in Paley-Wiener spaces on combinatorial graphs. Trans. of the Am. Math. Soc. 360(10), 5603\u20135627 (2008)","journal-title":"Trans. of the Am. Math. Soc."},{"key":"1861_CR35","unstructured":"Powers, D.L., Licata, C.: A surprising property of some regular polytopes. Tech. rep. Clarkson University, Potsdam NY, Dept Of Mathematics and Computer Science (1986)"},{"key":"1861_CR36","unstructured":"Powers, D.L.: The Petersen polytopes. Tech. rep. Clarkson University, Potsdam NY, Dept Of Mathematics and Computer Science (1986)"},{"issue":"3","key":"1861_CR37","doi-asserted-by":"publisher","first-page":"399","DOI":"10.1137\/0609035","volume":"9","author":"DL Powers","year":"1988","unstructured":"Powers, D.L.: Eigenvectors of distance-regular graphs. SIAM J. Matrix Anal. Appl. 9(3), 399\u2013407 (1988)","journal-title":"SIAM J. Matrix Anal. Appl."},{"key":"1861_CR38","unstructured":"Sureda, A.P., Pfeifle, J.: Graph operations and Laplacian eigenpolytopes. In: VII Jornadas de Matem\u00e1tica Discreta y Algor\u00edtmica, pp. 505\u2013516 (2010)"},{"key":"1861_CR39","unstructured":"Rooney, B.: Spectral Aspects of Cocliques in Graphs. University of Waterloo (2014)"},{"key":"1861_CR40","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4757-6804-6","volume-title":"The Symmetric Group: Representations, Combinatorial Algorithms, and Symmetric Functions","author":"BE Sagan","year":"2001","unstructured":"Sagan, B.E.: The Symmetric Group: Representations, Combinatorial Algorithms, and Symmetric Functions, vol. 203, 2nd edn. Springer, New York (2001)","edition":"2"},{"key":"1861_CR41","doi-asserted-by":"crossref","unstructured":"Serre, J.-P.: Linear Representations of Finite Groups. Graduate Texts in Mathematics, Vol. 42. Translated from the second French edition by Leonard L. Scott. Springer-Verlag, New York-Heidelberg (1977)","DOI":"10.1007\/978-1-4684-9458-7"},{"key":"1861_CR42","doi-asserted-by":"publisher","first-page":"128","DOI":"10.1016\/j.acha.2006.03.004","volume":"21","author":"A Singer","year":"2006","unstructured":"Singer, A.: From graph to manifold Laplacian: the convergence rate. Appl. and Comput. Harmonic Anal. 21, 128\u2013134 (2006)","journal-title":"Appl. and Comput. Harmonic Anal."},{"issue":"7","key":"1861_CR43","doi-asserted-by":"publisher","first-page":"1644","DOI":"10.1109\/TSP.2013.2238935","volume":"61","author":"A Sandryhaila","year":"2013","unstructured":"Sandryhaila, A., Moura, J.M.F.: Discrete signal processing on graphs. IEEE Trans. on Signal Process. 61(7), 1644\u20131656 (2013)","journal-title":"IEEE Trans. on Signal Process."},{"key":"1861_CR44","unstructured":"Steinerberger, S., Thomas, R.R.: Random Walks, Equidistribution and Graphical Designs. (2022). arXiv: 2206.05346"},{"issue":"2","key":"1861_CR45","doi-asserted-by":"publisher","first-page":"253","DOI":"10.1002\/jgt.22485","volume":"93","author":"S Steinerberger","year":"2020","unstructured":"Steinerberger, S.: Generalized designs on graphs: sampling, spectra, symmetries. J. of Graph Theory 93(2), 253\u2013267 (2020)","journal-title":"J. of Graph Theory"},{"issue":"6","key":"1861_CR46","doi-asserted-by":"publisher","first-page":"14","DOI":"10.1109\/MSP.2020.3016908","volume":"37","author":"Y Tanaka","year":"2020","unstructured":"Tanaka, Y., et al.: Sampling signals on graphs: From theory to applications. IEEE Signal Process. Magazine 37(6), 14\u201330 (2020)","journal-title":"IEEE Signal Process. Magazine"},{"issue":"3","key":"1861_CR47","doi-asserted-by":"publisher","first-page":"287","DOI":"10.1137\/0605030","volume":"5","author":"RM Tanner","year":"1984","unstructured":"Tanner, R.M.: Explicit concentrators from generalized n-gons. SIAM J. on Algebr. and Discrete Methods. 5(3), 287\u2013293 (1984)","journal-title":"SIAM J. on Algebr. and Discrete Methods."},{"issue":"18","key":"1861_CR48","doi-asserted-by":"publisher","first-page":"4845","DOI":"10.1109\/TSP.2016.2573748","volume":"64","author":"M Tsitsvero","year":"2016","unstructured":"Tsitsvero, M., Barbarossa, S., Di Lorenzo, P.: Signals on graphs: Uncertainty principle and sampling. IEEE Trans. on Signal Process.; a Publication of the IEEE Signal Process. Soc. 64(18), 4845\u20134860 (2016)","journal-title":"IEEE Trans. on Signal Process.; a Publication of the IEEE Signal Process. Soc."},{"issue":"1\u20133","key":"1861_CR49","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1023\/A:1008302520762","volume":"17","author":"HN Ward","year":"1999","unstructured":"Ward, H.N.: An introduction to divisible codes. Des. Codes Cryptogr. 17(1\u20133), 73\u201379 (1999)","journal-title":"Des. Codes Cryptogr."},{"key":"1861_CR50","unstructured":"Winter, M.: Eigenpolytopes, spectral polytopes and edge-transitivity. (2020). arXiv: 2009.02179 [math.MG]"},{"key":"1861_CR51","unstructured":"Winter, M.: Spectral Realizations of Symmetric Graphs, Spectral Polytopes and Edge-Transitivity. Technische Universit\u00e4t Chemnitz (2021)"},{"key":"1861_CR52","volume-title":"Lectures on Polytopes. Vol. 152. Graduate Texts in Mathematics","author":"GM Ziegler","year":"1995","unstructured":"Ziegler, G.M.: Lectures on Polytopes. Vol. 152. Graduate Texts in Mathematics. Springer-Verlag, New York (1995)"}],"container-title":["Mathematical Programming"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-022-01861-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10107-022-01861-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-022-01861-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,6,21]],"date-time":"2023-06-21T12:07:51Z","timestamp":1687349271000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10107-022-01861-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,7,23]]},"references-count":52,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2023,7]]}},"alternative-id":["1861"],"URL":"https:\/\/doi.org\/10.1007\/s10107-022-01861-0","relation":{},"ISSN":["0025-5610","1436-4646"],"issn-type":[{"value":"0025-5610","type":"print"},{"value":"1436-4646","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,7,23]]},"assertion":[{"value":"7 April 2022","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"4 July 2022","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"23 July 2022","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}