Skip to main content

Non-Monotonicity of Closed Convexity in Neural Codes

Abstract

Neural codes are lists of subsets of neurons that fire together. Of particular interest are neurons called place cells, which fire when an animal is in specific, usually convex regions in space. A fundamental question, therefore, is to determine which neural codes arise from the regions of some collection of open convex sets or closed convex sets in Euclidean space. This work focuses on how these two classes of codes – open convex and closed convex codes – are related. As a starting point, open convex codes have a desirable monotonicity property, namely, adding non-maximal codewords preserves open convexity; but here we show that this property fails to hold for closed convex codes. Additionally, while adding non-maximal codewords can only increase the open embedding dimension by 1, here we demonstrate that adding a single such codeword can increase the closed embedding dimension by an arbitrarily large amount. Finally, we disprove a conjecture of Goldrup and Phillipson, and also present an example of a code that is neither open convex nor closed convex.

This is a preview of subscription content, access via your institution.

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5
Fig. 6
Fig. 7

References

  1. Chen, A., Frick, F., Shiu, A.: Neural codes, decidability, and a new local obstruction to convexity. SIAM J. Appl. Algebra Geom. 3, 44–66 (2019)

    MathSciNet  Article  Google Scholar 

  2. Cruz, J., Giusti, C., Itskov, V., Kronholm, B.: On open and closed convex codes. Discrete Comput. Geom. 61, 247–270 (2019)

    MathSciNet  Article  Google Scholar 

  3. 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–1611 (2013)

    MathSciNet  Article  Google Scholar 

  4. 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, 222–238 (2017)

    MathSciNet  MATH  Google Scholar 

  5. Franke, M., Muthiah, S.: Every binary code can be realized by convex sets. Adv. Appl. Math. 99, 83–93 (2018)

    MathSciNet  Article  Google Scholar 

  6. Giusti, C., Itskov, V.: A no-go theorem for one-layer feedforward networks. Neural Comput. 26, 2527–2540 (2014)

    MathSciNet  Article  Google Scholar 

  7. Goldrup, S. A., Phillipson, K.: Classification of open and closed convex codes on five neurons. Adv. Appl. Math. 112, 101948 (2020)

    MathSciNet  Article  Google Scholar 

  8. Itskov, V., Kunin, A., Rosen, Z.: Hyperplane neural codes and the polar complex. In: Baas, N. A., Carlsson, G. E., Quick, G., Szymik, M., Thaule, M (eds.) Topological Data Analysis. Abel Symbosia, vol. 15, pp 343–369. Springer, Cham (2020)

  9. Jeffs, R. A.: Embedding dimension phenomena in intersection complete codes. arXiv:1909.13406 (2019)

  10. Jeffs, R. A.: Sunflowers of convex open sets. Adv. Appl. Math. 111, 101935 (2019)

    MathSciNet  Article  Google Scholar 

  11. Jeffs, R. A.: Morphisms of neural codes. SIAM J. Appl. Algebra Geom. 4, 99–122 (2020)

    MathSciNet  Article  Google Scholar 

  12. Jeffs, R. A., Novik, I.: Convex union representability and convex codes. Int. Math. Res. Not. 2021, 7132–7158 (2021)

    MathSciNet  Article  Google Scholar 

  13. Jeffs, R. A., Omar, M., Suaysom, N., Wachtel, A., Youngs, N.: Sparse neural codes and convexity. Involve 12, 737–754 (2019)

    MathSciNet  Article  Google Scholar 

  14. Kunin, A., Lienkaemper, C., Rosen, Z.: Oriented matroids and combinatorial neural codes. arXiv:2002.03542 (2020)

  15. Lienkaemper, C., Shiu, A., Woodstock, Z.: Obstructions to convexity in neural codes. Adv. Appl. Math. 85, 31–59 (2017)

    MathSciNet  Article  Google Scholar 

  16. O’Keefe, J., Dostrovsky, J.: The hippocampus as a spatial map. Preliminary evidence from unit activity in the freely-moving rat. Brain Res. 34, 171–175 (1971)

    Article  Google Scholar 

  17. Rosen, Z., Zhang, Y. X.: Convex neural codes in dimension 1. arXiv:1702.06907 (2017)

  18. Tancer, M.: Intersection patterns of convex sets via simplicial complexes: a survey. In: Pach, J (ed.) Thirty Essays on Geometric Graph Theory, pp 521–540. Springer, New York (2013)

  19. Williams, R.: Strongly maximal intersection-complete neural codes on grids are convex. Appl. Math. Comput. 336, 162–175 (2018)

    MathSciNet  MATH  Google Scholar 

Download references

Acknowledgements

The authors thank Aaron Chen, Chad Giusti, Kaitlyn Phillipson, and Thomas Yahl for insightful comments and suggestions, and thank Nida Obatake for editorial suggestions. The authors are also grateful to four referees for detailed comments which improved this work. BG, SM, and AS are grateful to Ramona Heuing and Martina Juhnke-Kubitzke for finding a crucial error in a prior version of this work. BG and SM initiated this research in the 2019 REU in the Department of Mathematics at Texas A&M University, supported by the NSF (DMS-1757872). AS was supported by the NSF (DMS-1752672). RAJ was supported by the NSF (DGE-1761124).

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Anne Shiu.

Additional information

Publisher’s Note

Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Dedicated to Bernd Sturmfels on the occasion of his 60th birthday.

Rights and permissions

Reprints and Permissions

About this article

Verify currency and authenticity via CrossMark

Cite this article

Gambacini, B., Jeffs, R.A., Macdonald, S. et al. Non-Monotonicity of Closed Convexity in Neural Codes. Vietnam J. Math. 50, 359–373 (2022). https://doi.org/10.1007/s10013-021-00521-8

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10013-021-00521-8

Keywords

  • Neural code
  • Place cell
  • Convex
  • Simplicial complex

Mathematics Subject Classification (2010)

  • 52A20
  • 52C99
  • 32F27