{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,29]],"date-time":"2025-12-29T14:29:10Z","timestamp":1767018550450,"version":"3.48.0"},"reference-count":19,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2025,10,28]],"date-time":"2025-10-28T00:00:00Z","timestamp":1761609600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2025,10,28]],"date-time":"2025-10-28T00:00:00Z","timestamp":1761609600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"DOI":"10.13039\/100006919","name":"Massachusetts Institute of Technology","doi-asserted-by":"crossref","id":[{"id":"10.13039\/100006919","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Discrete Comput Geom"],"published-print":{"date-parts":[[2026,1]]},"abstract":"<jats:title>Abstract<\/jats:title>\n                  <jats:p>\n                    Convex neural codes are subsets of the Boolean lattice that record the intersection patterns of convex sets in Euclidean space. Much work in recent years has focused on finding combinatorial criteria on codes that can be used to classify whether or not a code is convex. In this paper we introduce\n                    <jats:italic>order-forcing<\/jats:italic>\n                    , a combinatorial tool which recognizes when certain regions in a realization of a code must appear along a line segment between other regions. We use order-forcing to construct novel examples of non-convex codes, and to expand existing families of examples. We also construct a family of codes which shows that a dimension bound of Cruz, Giusti, Itskov, and Kronholm (referred to as monotonicity of open convexity) is tight in all dimensions.\n                  <\/jats:p>","DOI":"10.1007\/s00454-025-00760-3","type":"journal-article","created":{"date-parts":[[2025,10,28]],"date-time":"2025-10-28T15:31:43Z","timestamp":1761665503000},"page":"1-23","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Order-forcing in Neural Codes"],"prefix":"10.1007","volume":"75","author":[{"given":"R. Amzi","family":"Jeffs","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2570-4165","authenticated-orcid":false,"given":"Caitlin","family":"Lienkaemper","sequence":"additional","affiliation":[]},{"given":"Nora","family":"Youngs","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2025,10,28]]},"reference":[{"key":"760_CR1","doi-asserted-by":"publisher","DOI":"10.1016\/j.aam.2019.101935","volume":"111","author":"R Amzi Jeffs","year":"2019","unstructured":"Amzi Jeffs, R.: Sunflowers of convex open sets. Adv. Appl. Math. 111, 101935 (2019)","journal-title":"Adv. Appl. Math."},{"issue":"18","key":"760_CR2","first-page":"37","volume":"28","author":"R Amzi Jeffs","year":"2022","unstructured":"Amzi Jeffs, R.: Embedding dimension phenomena in intersection complete codes. Selecta Math. (N.S.) 28(18), 37 (2022)","journal-title":"Selecta Math. (N.S.)"},{"key":"760_CR3","first-page":"99122","volume":"4","author":"R Amzi Jeffs","year":"2020","unstructured":"Amzi Jeffs, R.: Morphisms of neural codes. SIAM J. Appl. Algebra Geometry 4, 99122 (2020)","journal-title":"SIAM J. Appl. Algebra Geometry"},{"issue":"5","key":"760_CR4","first-page":"737 754","volume":"12","author":"R Amzi Jeffs","year":"2015","unstructured":"Amzi Jeffs, R., Omar, M., Suaysom, N., Wachtel, A., Youngs, N.: Sparse neural codes and convexity. Involve J. Math. 12(5), 737\u2013754 (2015)","journal-title":"Involve J. Math."},{"issue":"7132","key":"760_CR5","first-page":"7158","volume":"9","author":"R Amzi Jeffs","year":"2021","unstructured":"Amzi Jeffs, R., Novik, I.: Convex union representability and convex codes. Int. Math. Res. Not. IMRN 9(7132), 7158 (2021)","journal-title":"Int. Math. Res. Not. IMRN"},{"key":"760_CR6","doi-asserted-by":"publisher","unstructured":"Chan, P., Johnston, K., Lent, J., de Perez, A. R., Shiu, A.: Nondegenerate neural codes and obstructions to closed-convexity. SIAM Journal on Discrete Mathematics, 37(1), 114\u2013145 (2023). https:\/\/doi.org\/10.1137\/21m1452147","DOI":"10.1137\/21m1452147"},{"key":"760_CR7","doi-asserted-by":"publisher","first-page":"44 66","DOI":"10.1137\/18M1186563","volume":"3","author":"A Chen","year":"2019","unstructured":"Chen, A., Frick, F., Shiu, A.: Neural codes, decidability, and a new local obstruction to convexity. SIAM J. Appl. Algebra Geometry 3, 44\u201366 (2019). https:\/\/doi.org\/10.1137\/18M1186563","journal-title":"SIAM J. Appl. Algebra Geometry"},{"key":"760_CR8","volume":"61","author":"J Cruz","year":"2016","unstructured":"Cruz, J., Giusti, C., Itskov, V., Kronholm, B.: On open and closed convex codes. Discrete Comput. Geometry 61, 247270 (2016)","journal-title":"Discrete Comput. Geometry"},{"key":"760_CR9","doi-asserted-by":"publisher","DOI":"10.1371\/journal.pcbi.1000205","volume":"4","author":"C Curto","year":"2008","unstructured":"Curto, C., Itskov, V.: Cell groups reveal structure of stimulus space. PLoS Comput. Biol. 4, e1000205 (2008)","journal-title":"PLoS Comput. Biol."},{"key":"760_CR10","doi-asserted-by":"publisher","first-page":"1571 1611","DOI":"10.1007\/s11538-013-9860-3","volume":"75","author":"C Curto","year":"2013","unstructured":"Curto, C., Itskov, V., Veliz-Cuba, A., Youngs, N.: The neural ring: an algebraic tool for analyzing the intrinsic structure of neural codes. Bull. Math. Biol. 75, 1571\u20131611 (2013)","journal-title":"Bull. Math. Biol."},{"key":"760_CR11","unstructured":"Curto, C., Vera, R.: The Leray Dimension of a Convex Code, arXiv:1612.07797 (2016)"},{"key":"760_CR12","doi-asserted-by":"crossref","unstructured":"Gambacini, B., Amzi Jeffs, R., Macdonald, S., Shiu, A.: Non-monotonicity of closed convexity in neural codes. Vietnam J. Math. 50(2), 359\u2013373 (2022)","DOI":"10.1007\/s10013-021-00521-8"},{"issue":"11","key":"760_CR13","doi-asserted-by":"publisher","first-page":"2527 2540","DOI":"10.1162\/NECO_a_00657","volume":"26","author":"C Giusti","year":"2014","unstructured":"Giusti, C., Itskov, V.: A no-go theorem for one-layer feedforward networks. Neural Comput. 26(11), 2527\u20132540 (2014)","journal-title":"Neural Comput."},{"key":"760_CR14","doi-asserted-by":"crossref","unstructured":"Goldrup, S.A., Phillipson, K.: Classification of open and closed convex codes on five neurons. Adv. Appl. Math. 112, 101948 (2020)","DOI":"10.1016\/j.aam.2019.101948"},{"issue":"2","key":"760_CR15","volume":"31","author":"E Jacob","year":"1991","unstructured":"Jacob, E.: Goodman and Richard Pollack, The complexity of point configurations. Discret. Appl. Math. 31(2), 167\u2013180 (1991)","journal-title":"Discret. Appl. Math."},{"key":"760_CR16","first-page":"175","volume":"171","author":"O John","year":"1971","unstructured":"John, O., Jonathan, D.: The hippocampus as a spatial map. Preliminary evidence from unit activity in the freely-moving rat. Brain Res. 171, 175 (1971)","journal-title":"Brain Res."},{"key":"760_CR17","doi-asserted-by":"publisher","unstructured":"Kunin, A., Lienkaemper, C., Rosen, Z.: (2023) Oriented matroids and combinatorial neural codes, Combinatorial Theory, 3(1) https:\/\/doi.org\/10.5070\/C63160427","DOI":"10.5070\/C63160427"},{"issue":"31","key":"760_CR18","first-page":"59","volume":"85","author":"C Lienkaemper","year":"2017","unstructured":"Lienkaemper, C., Shiu, A., Woodstock, Z.: Obstructions to convexity in neural codes. Adv. Appl. Math. 85(31), 59 (2017)","journal-title":"Adv. Appl. Math."},{"key":"760_CR19","doi-asserted-by":"crossref","unstructured":"Tancer, M.: Intersection patterns of convex sets via simplicial complexes: a survey. Thirty essays on geometric graph theory(521), 540 (2013)","DOI":"10.1007\/978-1-4614-0110-0_28"}],"container-title":["Discrete &amp; Computational Geometry"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00454-025-00760-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00454-025-00760-3","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00454-025-00760-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,12,29]],"date-time":"2025-12-29T14:26:44Z","timestamp":1767018404000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00454-025-00760-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,10,28]]},"references-count":19,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2026,1]]}},"alternative-id":["760"],"URL":"https:\/\/doi.org\/10.1007\/s00454-025-00760-3","relation":{},"ISSN":["0179-5376","1432-0444"],"issn-type":[{"type":"print","value":"0179-5376"},{"type":"electronic","value":"1432-0444"}],"subject":[],"published":{"date-parts":[[2025,10,28]]},"assertion":[{"value":"18 December 2020","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"16 January 2023","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"18 June 2025","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"28 October 2025","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors declare that they have no conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}]}}