{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,18]],"date-time":"2025-11-18T02:45:43Z","timestamp":1763433943517,"version":"3.45.0"},"reference-count":29,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2025,9,18]],"date-time":"2025-09-18T00:00:00Z","timestamp":1758153600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2025,9,18]],"date-time":"2025-09-18T00:00:00Z","timestamp":1758153600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Order"],"published-print":{"date-parts":[[2025,12]]},"abstract":"<jats:title>Abstract<\/jats:title>\n                  <jats:p>Ahlswede and Cai proved that if a simple graph has nested solutions under the edge-isoperimetric problems, and the lexicographic order produces nested solutions for its second cartesian power, then the lexicographic order produces nested solutions for any finite cartesian power. Under very general assumptions, we prove that if a graph and its second cartesian power have nested solutions, then so does any finite cartesian power. This is achieved by proving that the lexicographic order and colexcographic order are the only possible nested solutions in many cases. Harper asked if this is true without any restriction. We also conjecture that it is. All graphs studied in the literature for which the lexicographic order is optimal are regular. This lead Bezrukov and Els\u00e4sser to conjecture that if the lexicographic order is optimal for the second cartesian power, then the original graph is regular. A counterexample to this conjecture is provided.<\/jats:p>","DOI":"10.1007\/s11083-025-09711-2","type":"journal-article","created":{"date-parts":[[2025,9,18]],"date-time":"2025-09-18T11:59:05Z","timestamp":1758196745000},"page":"829-836","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Towards a Complete Local-Global Principle"],"prefix":"10.1007","volume":"42","author":[{"given":"Nikola","family":"Kuzmanovski","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2025,9,18]]},"reference":[{"issue":"2","key":"9711_CR1","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1016\/0893-9659(95)00015-I","volume":"8","author":"R Ahlswede","year":"1995","unstructured":"Ahlswede, R., Bezrukov, S.L.: Edge isoperimetric theorems for integer point arrays. Appl. Math. Lett. 8(2), 75\u201380 (1995)","journal-title":"Appl. Math. Lett."},{"key":"9711_CR2","doi-asserted-by":"crossref","unstructured":"Ahlswede, R., Cai, N.: General edge-isoperimetric inequalities. II. A local-global principle for lexicographical solutions. European J. Combin. 18(5), 479\u2013489 (1997)","DOI":"10.1006\/eujc.1996.0106"},{"issue":"6","key":"9711_CR3","doi-asserted-by":"publisher","first-page":"1485","DOI":"10.1137\/0115129","volume":"15","author":"AJ Bernstein","year":"1967","unstructured":"Bernstein, A.J.: Maximally connected arrays on the n-cube. SIAM J. Appl. Math. 15(6), 1485\u20131489 (1967)","journal-title":"SIAM J. Appl. Math."},{"key":"9711_CR4","unstructured":"Bezrukov, S.L.: Edge isoperimetric problems on graphs. In Lov\u00e1sz, L., Gy\u00e1rf\u00e1s, A., Katona, G.O.H., Recski, A., Sz\u00e9kely, L.A. (eds.) Graph Theory and Combinatorial Biology J\u00e1nos Bolyai Mathematical Society, pp.\u00a0157\u2013197. Budapest (1999)"},{"key":"9711_CR5","unstructured":"Bezrukov, S.L. Dissanayake, A.: Isoperimetric Tools available at http:\/\/cs2.uwsuper.edu\/sb\/posets\/"},{"issue":"1","key":"9711_CR6","doi-asserted-by":"publisher","first-page":"9","DOI":"10.1016\/S0012-365X(99)00013-8","volume":"203","author":"SL Bezrukov","year":"1999","unstructured":"Bezrukov, S.L.: On an equivalence in discrete extremal problems. Discrete Math. 203(1), 9\u201322 (1999)","journal-title":"Discrete Math."},{"key":"9711_CR7","doi-asserted-by":"publisher","first-page":"42","DOI":"10.1016\/j.tcs.2017.12.036","volume":"721","author":"SL Bezrukov","year":"2018","unstructured":"Bezrukov, S.L., Bulatovic, P., Kuzmanovski, N.: New infinite family of regular edge-isoperimetric graphs. Theo. Comput. Sci. 721, 42\u201353 (2018)","journal-title":"Theo. Comput. Sci."},{"key":"9711_CR8","doi-asserted-by":"publisher","first-page":"153","DOI":"10.1007\/s000260050003","volume":"4","author":"SL Bezrukov","year":"2000","unstructured":"Bezrukov, S.L., Das, S.K., Els\u00e4sser, R.: An edge-isoperimetric problem for powers of the Petersen graph. Ann. Comb. 4, 153\u2013169 (2000)","journal-title":"Ann. Comb."},{"key":"9711_CR9","doi-asserted-by":"crossref","unstructured":"Bezrukov, S.L., Els\u00e4sser, R.: Edge-isoperimetric problems for cartesian powers of regular graphs. Theo. Comput. Sci. 307(3), 473\u2013492 (2003). Selected Papers in honor of Lawrence Harper","DOI":"10.1016\/S0304-3975(03)00232-9"},{"key":"9711_CR10","doi-asserted-by":"crossref","unstructured":"Bezrukov, S.L., Kuzmanovski, N., Lim, J.: Pull-push method. a new approach to edge-isoperimetric problems. Discrete Math. 346(12) (2023)","DOI":"10.1016\/j.disc.2023.113632"},{"issue":"2","key":"9711_CR11","doi-asserted-by":"publisher","first-page":"161","DOI":"10.1016\/S0097-3165(03)00017-7","volume":"105","author":"SL Bezrukov","year":"2004","unstructured":"Bezrukov, S.L., Piotrowski, V.P., Pfaff, T.J.: A new approach to Macaulay posets. J. Comb. Theory Series A 105(2), 161\u2013184 (2004)","journal-title":"J. Comb. Theory Series A"},{"issue":"4","key":"9711_CR12","doi-asserted-by":"publisher","first-page":"299","DOI":"10.1007\/BF01275667","volume":"11","author":"B Bollob\u00e1s","year":"1991","unstructured":"Bollob\u00e1s, B., Leader, I.: Edge-isoperimetric inequalities in the grid. Combinatorica 11(4), 299\u2013314 (1991)","journal-title":"Combinatorica"},{"issue":"06","key":"9711_CR13","doi-asserted-by":"publisher","first-page":"771","DOI":"10.1142\/S0129054116500283","volume":"27","author":"E Bonnet","year":"2016","unstructured":"Bonnet, E., Sikora, F.: A note on edge isoperimetric numbers and regular graphs. Int. J. Found. Comput. Sci. 27(06), 771\u2013774 (2016)","journal-title":"Int. J. Found. Comput. Sci."},{"key":"9711_CR14","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1016\/S0012-365X(01)00432-0","volume":"254","author":"TA Carlson","year":"2002","unstructured":"Carlson, T.A.: The edge-isoperimetric problem for discrete tori. Discrete Math. 254, 33\u201349 (2002)","journal-title":"Discrete Math."},{"issue":"1","key":"9711_CR15","doi-asserted-by":"publisher","first-page":"13","DOI":"10.1090\/S0002-9939-1971-0270923-7","volume":"27","author":"GF Clements","year":"1971","unstructured":"Clements, G.F.: Sets of lattice points which contain a maximal number of edges. Proc. Am. Math. Soc. 27(1), 13\u201315 (1971)","journal-title":"Proc. Am. Math. Soc."},{"key":"9711_CR16","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511574719","volume-title":"Sperner Theory","author":"K Engel","year":"1997","unstructured":"Engel, K.: Sperner Theory. Cambridge University Press, Encyclopedia of Mathematics and its Applications (1997)"},{"issue":"1","key":"9711_CR17","doi-asserted-by":"publisher","first-page":"131","DOI":"10.1137\/0112012","volume":"12","author":"LH Harper","year":"1964","unstructured":"Harper, L.H.: Optimal assignments of numbers to vertices. J. Soc. Ind. Appl. Math. 12(1), 131\u2013135 (1964)","journal-title":"J. Soc. Ind. Appl. Math."},{"key":"9711_CR18","doi-asserted-by":"crossref","unstructured":"Harper, L.H.: Global methods for combinatorial isoperimetric problems. Cambridge studies in advanced mathematics 90. Cambridge University Press, Cambridge (2004)","DOI":"10.1017\/CBO9780511616679"},{"issue":"2","key":"9711_CR19","doi-asserted-by":"publisher","first-page":"157","DOI":"10.1016\/0012-365X(76)90058-3","volume":"14","author":"S Hart","year":"1976","unstructured":"Hart, S.: A note on the edges of the n-cube. Discrete Math. 14(2), 157\u2013163 (1976)","journal-title":"Discrete Math."},{"key":"9711_CR20","unstructured":"Katona, G.: A theorem of finite sets. In Erd\u0151s P. (ed.) Theory on Graphs (Proceedings of the colloquium held at Tihany, Hungary September 1966), Academic Press, New York and London, pp.\u00a0381\u2013401. (1968)"},{"issue":"2","key":"9711_CR21","doi-asserted-by":"publisher","first-page":"115","DOI":"10.1002\/sapm1971502115","volume":"50","author":"DJ Kleitman","year":"1971","unstructured":"Kleitman, D.J., Krieger, M.M., Rothschild, B.L.: Configurations maximizing the number of pairs of hamming-adjacent lattice points. Stud. Appl. Math. 50(2), 115\u2013119 (1971)","journal-title":"Stud. Appl. Math."},{"key":"9711_CR22","doi-asserted-by":"publisher","first-page":"251","DOI":"10.1525\/9780520319875-014","volume-title":"Mathematical Optimization Techniques","author":"JB Kruskal","year":"1963","unstructured":"Kruskal, J.B.: The number of simplices in a complex. In: Bellman, R. (ed.) Mathematical Optimization Techniques, pp. 251\u2013278. University of California Press, Berkeley and Los Angeles (1963)"},{"key":"9711_CR23","unstructured":"Kuzmanovski, N.: Macaulay posets and rings. arXiv:2307.05094 (2023)"},{"issue":"5","key":"9711_CR24","doi-asserted-by":"publisher","first-page":"508","DOI":"10.1080\/00029890.1964.11992272","volume":"71","author":"J Lindsey","year":"1964","unstructured":"Lindsey, J.: Assignment of numbers to vertices. Am. Math. Mon. 71(5), 508\u2013516 (1964)","journal-title":"Am. Math. Mon."},{"key":"9711_CR25","doi-asserted-by":"crossref","unstructured":"Macaulay, F.S.: Some properties of enumeration in the theory of modular systems. Proc. Lond. Math. Soc. s2-26(1), 531\u2013555 (1927)","DOI":"10.1112\/plms\/s2-26.1.531"},{"key":"9711_CR26","unstructured":"Mermin, J.: Lexicographic Ideals. PhD thesis, Cornell University (2006)"},{"issue":"2","key":"9711_CR27","doi-asserted-by":"publisher","first-page":"299","DOI":"10.1007\/s10801-009-0192-1","volume":"31","author":"J Mermin","year":"2010","unstructured":"Mermin, J., Murai, S.: Betti numbers of lex ideals over some Macaulay-lex rings. J. Algebraic Comb. 31(2), 299\u2013318 (2010)","journal-title":"J. Algebraic Comb."},{"issue":"2\u20133","key":"9711_CR28","doi-asserted-by":"publisher","first-page":"409","DOI":"10.4310\/MRL.2006.v13.n3.a6","volume":"13","author":"J Mermin","year":"2006","unstructured":"Mermin, J., Peeva, I.: Lexifying ideals. Math. Res. Lett. 13(2\u20133), 409\u2013422 (2006)","journal-title":"Math. Res. Lett."},{"issue":"2","key":"9711_CR29","doi-asserted-by":"publisher","first-page":"642","DOI":"10.1016\/j.jalgebra.2007.03.036","volume":"313","author":"J Mermin","year":"2007","unstructured":"Mermin, J., Peeva, I.: Hilbert functions and lex ideals. J. Algebra 313(2), 642\u2013656 (2007)","journal-title":"J. Algebra"}],"container-title":["Order"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11083-025-09711-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11083-025-09711-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11083-025-09711-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,11,18]],"date-time":"2025-11-18T02:41:27Z","timestamp":1763433687000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11083-025-09711-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,9,18]]},"references-count":29,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2025,12]]}},"alternative-id":["9711"],"URL":"https:\/\/doi.org\/10.1007\/s11083-025-09711-2","relation":{},"ISSN":["0167-8094","1572-9273"],"issn-type":[{"type":"print","value":"0167-8094"},{"type":"electronic","value":"1572-9273"}],"subject":[],"published":{"date-parts":[[2025,9,18]]},"assertion":[{"value":"24 August 2024","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"3 September 2025","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"18 September 2025","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"Not applicable.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Ethical Approval"}},{"value":"The authors declare no competing interests.","order":3,"name":"Ethics","group":{"name":"EthicsHeading","label":"Competing Interests"}}]}}