{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T03:46:36Z","timestamp":1740109596061,"version":"3.37.3"},"reference-count":19,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2023,6,5]],"date-time":"2023-06-05T00:00:00Z","timestamp":1685923200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2023,6,5]],"date-time":"2023-06-05T00:00:00Z","timestamp":1685923200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"DOI":"10.13039\/501100008982","name":"National Science Foundation","doi-asserted-by":"publisher","award":["2103206"],"award-info":[{"award-number":["2103206"]}],"id":[{"id":"10.13039\/501100008982","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Discrete Comput Geom"],"published-print":{"date-parts":[[2024,3]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>We study the open, closed, and non-degenerate embedding dimensions of neural codes, which are the smallest respective dimensions in which one can find a realization of a code consisting of convex sets that are open, closed, or non-degenerate in a sense defined by Cruz, Giusti, Itskov, and Kronholm. For a given code <jats:inline-formula><jats:alternatives><jats:tex-math>$$\\mathcal {C}$$<\/jats:tex-math><mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\">\n                  <mml:mi>C<\/mml:mi>\n                <\/mml:math><\/jats:alternatives><\/jats:inline-formula> we define the embedding dimension vector to be the triple (<jats:italic>a<\/jats:italic>,\u00a0<jats:italic>b<\/jats:italic>,\u00a0<jats:italic>c<\/jats:italic>) consisting of these embedding dimensions. Existing results guarantee that <jats:inline-formula><jats:alternatives><jats:tex-math>$$\\max {\\{a,b\\}}\\le c$$<\/jats:tex-math><mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\">\n                  <mml:mrow>\n                    <mml:mo>max<\/mml:mo>\n                    <mml:mrow>\n                      <mml:mo>{<\/mml:mo>\n                      <mml:mi>a<\/mml:mi>\n                      <mml:mo>,<\/mml:mo>\n                      <mml:mi>b<\/mml:mi>\n                      <mml:mo>}<\/mml:mo>\n                    <\/mml:mrow>\n                    <mml:mo>\u2264<\/mml:mo>\n                    <mml:mi>c<\/mml:mi>\n                  <\/mml:mrow>\n                <\/mml:math><\/jats:alternatives><\/jats:inline-formula>, and we show that when any of these dimensions is at least\u00a02 this is the only restriction on such vectors. Specifically, for every triple (<jats:italic>a<\/jats:italic>,\u00a0<jats:italic>b<\/jats:italic>,\u00a0<jats:italic>c<\/jats:italic>) with <jats:inline-formula><jats:alternatives><jats:tex-math>$$2\\le \\min {\\{a,b\\}}$$<\/jats:tex-math><mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\">\n                  <mml:mrow>\n                    <mml:mn>2<\/mml:mn>\n                    <mml:mo>\u2264<\/mml:mo>\n                    <mml:mo>min<\/mml:mo>\n                    <mml:mrow>\n                      <mml:mo>{<\/mml:mo>\n                      <mml:mi>a<\/mml:mi>\n                      <mml:mo>,<\/mml:mo>\n                      <mml:mi>b<\/mml:mi>\n                      <mml:mo>}<\/mml:mo>\n                    <\/mml:mrow>\n                  <\/mml:mrow>\n                <\/mml:math><\/jats:alternatives><\/jats:inline-formula> and <jats:inline-formula><jats:alternatives><jats:tex-math>$$\\max {\\{a,b\\}}\\le c\\le \\infty $$<\/jats:tex-math><mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\">\n                  <mml:mrow>\n                    <mml:mo>max<\/mml:mo>\n                    <mml:mrow>\n                      <mml:mo>{<\/mml:mo>\n                      <mml:mi>a<\/mml:mi>\n                      <mml:mo>,<\/mml:mo>\n                      <mml:mi>b<\/mml:mi>\n                      <mml:mo>}<\/mml:mo>\n                    <\/mml:mrow>\n                    <mml:mo>\u2264<\/mml:mo>\n                    <mml:mi>c<\/mml:mi>\n                    <mml:mo>\u2264<\/mml:mo>\n                    <mml:mi>\u221e<\/mml:mi>\n                  <\/mml:mrow>\n                <\/mml:math><\/jats:alternatives><\/jats:inline-formula> we construct a code <jats:inline-formula><jats:alternatives><jats:tex-math>$$\\mathcal {C}_{(a,b,c)}$$<\/jats:tex-math><mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\">\n                  <mml:msub>\n                    <mml:mi>C<\/mml:mi>\n                    <mml:mrow>\n                      <mml:mo>(<\/mml:mo>\n                      <mml:mi>a<\/mml:mi>\n                      <mml:mo>,<\/mml:mo>\n                      <mml:mi>b<\/mml:mi>\n                      <mml:mo>,<\/mml:mo>\n                      <mml:mi>c<\/mml:mi>\n                      <mml:mo>)<\/mml:mo>\n                    <\/mml:mrow>\n                  <\/mml:msub>\n                <\/mml:math><\/jats:alternatives><\/jats:inline-formula> whose embedding dimension vector is exactly (<jats:italic>a<\/jats:italic>,\u00a0<jats:italic>b<\/jats:italic>,\u00a0<jats:italic>c<\/jats:italic>) (where an embedding dimension is <jats:inline-formula><jats:alternatives><jats:tex-math>$$\\infty $$<\/jats:tex-math><mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\">\n                  <mml:mi>\u221e<\/mml:mi>\n                <\/mml:math><\/jats:alternatives><\/jats:inline-formula> if there is no realization of the corresponding type). Our constructions combine two existing tools in the convex neural codes literature: sunflowers of convex open sets, and rigid structures, the latter of which was recently defined in work of Chan, Johnston, Lent, Ruys de Perez, and Shiu. Our constructions provide the first examples of codes whose closed embedding dimension is larger than their open embedding dimension, but still finite.<\/jats:p>","DOI":"10.1007\/s00454-023-00512-1","type":"journal-article","created":{"date-parts":[[2023,6,5]],"date-time":"2023-06-05T14:03:00Z","timestamp":1685973780000},"page":"764-786","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Open, Closed, and Non-Degenerate Embedding Dimensions of Neural Codes"],"prefix":"10.1007","volume":"71","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-2653-2286","authenticated-orcid":false,"given":"R. Amzi","family":"Jeffs","sequence":"first","affiliation":[],"role":[{"role":"author","vocab":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2023,6,5]]},"reference":[{"issue":"1","key":"512_CR1","doi-asserted-by":"publisher","first-page":"114","DOI":"10.1137\/21M1452147","volume":"37","author":"P Chan","year":"2023","unstructured":"Chan, P., Johnston, K., Lent, J., de Ruys Perez, A., Shiu, A.: Nondegenerate neural codes and obstructions to closed-convexity. SIAM J. Discrete Math. 37(1), 114\u2013145 (2023)","journal-title":"SIAM J. Discrete Math."},{"issue":"1","key":"512_CR2","doi-asserted-by":"publisher","first-page":"44","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 Geom. 3(1), 44\u201366 (2019)","journal-title":"SIAM J. Appl. Algebra Geom."},{"issue":"2","key":"512_CR3","doi-asserted-by":"publisher","first-page":"247","DOI":"10.1007\/s00454-018-00050-1","volume":"61","author":"J Cruz","year":"2019","unstructured":"Cruz, J., Giusti, Ch., Itskov, V., Kronholm, B.: On open and closed convex codes. Discrete Comput. Geom. 61(2), 247\u2013270 (2019)","journal-title":"Discrete Comput. Geom."},{"issue":"1","key":"512_CR4","doi-asserted-by":"publisher","first-page":"222","DOI":"10.1137\/16M1073170","volume":"1","author":"C Curto","year":"2017","unstructured":"Curto, C., Gross, E., Jeffries, J., Morrison, K., Omar, M., Rosen, Z., Shiu, A., Youngs, N.: What makes a neural code convex? SIAM J. Appl. Algebra Geom. 1(1), 222\u2013238 (2017)","journal-title":"SIAM J. Appl. Algebra Geom."},{"issue":"9","key":"512_CR5","doi-asserted-by":"publisher","first-page":"3919","DOI":"10.1016\/j.jpaa.2018.12.012","volume":"223","author":"C Curto","year":"2019","unstructured":"Curto, C., Gross, E., Jeffries, J., Morrison, K., Rosen, Z., Shiu, A., Youngs, N.: Algebraic signatures of convex and non-convex codes. J. Pure Appl. Algebra 223(9), 3919\u20133940 (2019)","journal-title":"J. Pure Appl. Algebra"},{"issue":"9","key":"512_CR6","doi-asserted-by":"publisher","first-page":"1571","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(9), 1571\u20131611 (2013)","journal-title":"Bull. Math. Biol."},{"issue":"2","key":"512_CR7","doi-asserted-by":"publisher","first-page":"359","DOI":"10.1007\/s10013-021-00521-8","volume":"50","author":"B Gambacini","year":"2022","unstructured":"Gambacini, B., Jeffs, R.A., Macdonald, S., Shiu, A.: Non-monotonicity of closed convexity in neural codes. Vietnam J. Math. 50(2), 359\u2013373 (2022)","journal-title":"Vietnam J. Math."},{"issue":"4","key":"512_CR8","doi-asserted-by":"publisher","first-page":"553","DOI":"10.1142\/S0218196718500261","volume":"28","author":"R Garcia","year":"2018","unstructured":"Garcia, R., Garc\u00eda Puente, L.D., Kruse, R., Liu, J., Miyata, D., Petersen, E., Phillipson, K., Shiu, A.: Gr\u00f6bner bases of neural ideals. Int. J. Algebra Comput. 28(4), 553\u2013571 (2018)","journal-title":"Int. J. Algebra Comput."},{"key":"512_CR9","doi-asserted-by":"crossref","unstructured":"Goldrup, S.A., Phillipson, K.: Classification of open and closed convex codes on five neurons. Adv. Appl. Math. 112, #\u00a0101948 (2020)","DOI":"10.1016\/j.aam.2019.101948"},{"key":"512_CR10","doi-asserted-by":"crossref","unstructured":"G\u00fcnt\u00fcrk\u00fcn, S., Jeffries, J., Sun, J.: Polarization of neural rings. J. Algebra Appl. 19(8), #\u00a02050146 (2020)","DOI":"10.1142\/S0219498820501467"},{"key":"512_CR11","doi-asserted-by":"crossref","unstructured":"Jeffs, R.A.: Sunflowers of convex open sets. Adv. Appl. Math. 111, #\u00a0101935 (2019)","DOI":"10.1016\/j.aam.2019.101935"},{"issue":"1","key":"512_CR12","doi-asserted-by":"publisher","first-page":"99","DOI":"10.1137\/18M1205509","volume":"4","author":"RA Jeffs","year":"2020","unstructured":"Jeffs, R.A.: Morphisms of neural codes. SIAM J. Appl. Algebra Geom. 4(1), 99\u2013122 (2020)","journal-title":"SIAM J. Appl. Algebra Geom."},{"key":"512_CR13","unstructured":"Jeffs, R.A.: Morphisms, Minors, and Minimal Obstructions to Convexity of Neural Codes. PhD thesis, University of Washington (2021). https:\/\/www.math.cmu.edu\/~amzij\/pdf\/Amzi_Jeffs_Thesis.pdf"},{"key":"512_CR14","doi-asserted-by":"crossref","unstructured":"Jeffs, R.A.: Embedding dimension phenomena in intersection complete codes. Selecta Math. 28(1), #\u00a018 (2022)","DOI":"10.1007\/s00029-021-00742-2"},{"key":"512_CR15","unstructured":"Jeffs, R.A., Lienkaemper, C., Youngs, N.: Order-forcing in neural codes (2020). arXiv:2011.03572"},{"issue":"9","key":"512_CR16","doi-asserted-by":"publisher","first-page":"7132","DOI":"10.1093\/imrn\/rnz055","volume":"2021","author":"RA Jeffs","year":"2021","unstructured":"Jeffs, R.A., Novik, I.: Convex union representability and convex codes. Int. Math. Res. Not. 2021(9), 7132\u20137158 (2021)","journal-title":"Int. Math. Res. Not."},{"key":"512_CR17","doi-asserted-by":"crossref","unstructured":"Kunin, A.B., Lienkaemper, C., Rosen, Z.: Oriented matroids and combinatorial neural codes. Comb. Theory 3(1), #\u00a014 (2023)","DOI":"10.5070\/C63160427"},{"key":"512_CR18","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1016\/j.aam.2016.11.006","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\u201359 (2017)","journal-title":"Adv. Appl. Math."},{"issue":"1","key":"512_CR19","doi-asserted-by":"publisher","first-page":"171","DOI":"10.1016\/0006-8993(71)90358-1","volume":"34","author":"J O\u2019Keefe","year":"1971","unstructured":"O\u2019Keefe, J., Dostrovsky, J.: The hippocampus as a spatial map. Preliminary evidence from unit activity in the freely-moving rat. Brain Res. 34(1), 171\u2013175 (1971)","journal-title":"Brain Res."}],"container-title":["Discrete &amp; Computational Geometry"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00454-023-00512-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00454-023-00512-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00454-023-00512-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,2,3]],"date-time":"2024-02-03T23:02:51Z","timestamp":1707001371000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00454-023-00512-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,6,5]]},"references-count":19,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2024,3]]}},"alternative-id":["512"],"URL":"https:\/\/doi.org\/10.1007\/s00454-023-00512-1","relation":{},"ISSN":["0179-5376","1432-0444"],"issn-type":[{"type":"print","value":"0179-5376"},{"type":"electronic","value":"1432-0444"}],"subject":[],"published":{"date-parts":[[2023,6,5]]},"assertion":[{"value":"30 November 2021","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"16 September 2022","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"6 October 2022","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"5 June 2023","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}