Abstract

Given an intersection pattern of arbitrary sets in Euclidean space, is there an arrangement of convex open sets in Euclidean space that exhibits the same intersections? This question is combinatorial and topological in nature, but is motivated by neuroscience. Specifically, we are interested in a type of neuron called a place cell, which fires precisely when an organism is in a certain region, usually convex, called a place field. The earlier question, therefore, can be rephrased as follows: Which neural codes, that is, patterns of neural activity, can arise from a collection of convex open sets? To address this question, Giusti and Itskov proved that convex neural codes have no “local obstructions,” which are defined via the topology of a code's simplicial complex. The absence of local obstructions is a necessary criterion for a code to arise from open sets that form a good cover. Here we prove that this criterion is also sufficient. The question of whether a code can be realized by a good cover thus reduces to local considerations. Algorithmically, however, this criterion---which is a method for proving a code is nonconvex---is infeasible: We prove that the good-cover decision problem is undecidable. Nonetheless, we reveal a stronger type of local obstruction that prevents a code from being convex, and prove that the corresponding decision problem is NP-hard. Our proofs use combinatorial and topological methods.

Keywords

  1. convex
  2. good cover
  3. simplicial complex
  4. decidability
  5. nerve lemma
  6. neural code
  7. place cell

MSC codes

  1. 05E45
  2. 55U10
  3. 92C20

Get full access to this article

View all available purchase options and get full access to this article.

References

1.
A. Björner, Topological methods, in Handbook of Combinatorics (Vol. 2), R. L. Graham, M. Grötschel, and L. Lovász, eds., MIT Press, Amsterdam, 1995, pp. 1819--1872.
2.
M. M. Cohen, A Course in Simple-Homotopy Theory, Graduate Texts in Mathematics 10, Springer-Verlag, New York, Berlin, 1973.
3.
J. Cruz, C. Giusti, V. Itskov, and B. Kronholm, On Open and Closed Convex Codes, preprint, https://arxiv.org/abs/1609.03502, 2016.
4.
C. Curto, E. Gross, J. Jeffries, K. Morrison, M. Omar, Z. Rosen, A. Shiu, and N. Youngs, What makes a neural code convex?, SIAM J. Appl. Algebra Geom., 1 (2017), pp. 222--238, https://doi.org/10.1137/16M1073170.
5.
C. Curto, V. Itskov, A. Veliz-Cuba, and N. Youngs, The neural ring: An algebraic tool for analyzing the intrinsic structure of neural codes, Bull. Math. Biol., 75 (2013), pp. 1571--1611.
6.
M. Franke and S. Muthiah, Every binary code can be realized by convex sets, Adv. in Appl. Math., 99 (2018), pp. 83--93.
7.
R. Garcia, L. D. García Puente, R. Kruse, J. Liu, D. Miyata, E. Petersen, K. Phillipson, and A. Shiu, Gröbner bases of neural ideals, Internat. J. Algebra Comput., 28 (2018), pp. 553--571.
8.
C. Giusti and V. Itskov, A no-go theorem for one-layer feedforward networks, Neural Comput., 26 (2014), pp. 2527--2540.
9.
E. Gross, N. K. Obatake, and N. Youngs, Neural ideals and stimulus space visualization, Adv. in Appl. Math., 95 (2018), pp. 65--95.
10.
A. Hatcher, Algebraic Topology, Cambridge University Press, Cambridge, 2002.
11.
M. Hoch, S. Muthiah, and N. Obatake, On the Identification of $k$-Inductively Pierced Codes Using Toric Ideals, preprint, https://arxiv.org/abs/1807.02390, 2018.
12.
V. Itskov, A. Kunin, and Z. Rosen, Hyperplane Neural Codes and the Polar Complex, preprint, https://arxiv.org/abs/1801.02304, 2018.
13.
J. Jeffries, S. Güntürkün, and J. Sun, Polarization of Neural Ideals, preprint, https://arxiv.org/abs/1706.08559, 2017.
14.
R. Amzi Jeffs and I. Novik, Convex Union Representability and Convex Codes, preprint, https://arxiv.org/abs/1808.03992, 2018.
15.
R. Amzi Jeffs, M. Omar, N. Suaysom, A. Wachtel, and N. Youngs, Sparse Neural Codes and Convexity, preprint, https://arxiv.org/abs/1511.00283, 2015.
16.
R. Amzi Jeffs, M. Omar, and N. Youngs, Homomorphisms preserving neural ideals, J. Pure Appl. Algebra, 222 (2018), pp. 3470--3482.
17.
C. Lienkaemper, A. Shiu, and Z. Woodstock, Obstructions to convexity in neural codes, Adv. in Appl. Math., 85 (2017), pp. 31--59.
18.
A. Morvant, Strengthening Relationships between Neural Ideals and Receptive Fields, preprint, https://arxiv.org/abs/1803.03204, 2018.
19.
R. Mulas and N. M. Tran, Characterization and Minimal Embeddings of Connected Neural Codes, preprint, https://arxiv.org/abs/1803.03204, 2017.
20.
J. O'Keefe and J. Dostrovsky, The hippocampus as a spatial map. Preliminary evidence from unit activity in the freely-moving rat, Brain Res., 34 (1971), pp. 171--175.
21.
Z. Rosen and Y. X. Zhang, Convex Neural Codes in Dimension 1, preprint, https://arxiv.org/abs/1702.06907, 2017.
22.
T. B. Rushing, Topological Embeddings, Pure and Applied Mathematics 52, Academic Press, New York, London, 1973.
23.
A. H. Stone, Paracompactness and product spaces, Bull. Amer. Math. Soc., 54 (1948), pp. 977--982.
24.
M. Tancer, Intersection patterns of convex sets via simplicial complexes: A survey, in Thirty Essays on Geometric Graph Theory, Springer, New York, 2013, pp. 521--540.
25.
M. Tancer, Recognition of collapsible complexes is NP-complete, Discrete Comput. Geom., 55 (2016), pp. 21--38.
26.
M. Tancer and D. Tonkonog, Nerves of good covers are algorithmically unrecognizable, SIAM J. Comput., 42 (2013), pp. 1697--1719, https://doi.org/10.1137/120891204.
27.
G. Wegner, Eigenschaften der Nerven homologisch-einfacher Familien im R$^n$, Ph.D. thesis, Universität Göttingen, Göttingen, Germany, 1967 (in German).
28.
G. Wegner, d-collapsing and nerves of families of convex sets, Arch. Math. (Basel), 26 (1975), pp. 317--321.
29.
A. Weil, Sur les théorèmes de de Rham, Comment. Math. Helv., 26 (1952), pp. 119--145.
30.
J. H. C. Whitehead, Simplicial spaces, nuclei and m-groups, Proc. London Math. Soc. (2), 45 (1939), pp. 243--327.
31.
R. Williams, Strongly maximal intersection-complete neural codes on grids are convex, Appl. Math. Comput., 336 (2018), pp. 162--175.
32.
E. C. Zeeman, On the dunce hat, Topology, 2 (1963), pp. 341--358.

Information & Authors

Information

Published In

cover image SIAM Journal on Applied Algebra and Geometry
SIAM Journal on Applied Algebra and Geometry
Pages: 44 - 66
ISSN (online): 2470-6566

History

Submitted: 10 May 2018
Accepted: 12 October 2018
Published online: 19 February 2019

Keywords

  1. convex
  2. good cover
  3. simplicial complex
  4. decidability
  5. nerve lemma
  6. neural code
  7. place cell

MSC codes

  1. 05E45
  2. 55U10
  3. 92C20

Authors

Affiliations

Funding Information

National Science Foundation https://doi.org/10.13039/100000001 : DMS-1460766
National Science Foundation https://doi.org/10.13039/100000001 : DMS-1312473, DMS-1513364
Simons Foundation https://doi.org/10.13039/100000893 : 521874

Metrics & Citations

Metrics

Citations

If you have the appropriate software installed, you can download article citation data to the citation manager of your choice. Simply select your manager software from the list below and click Download.

Cited By

View Options

View options

PDF

View PDF

Media

Figures

Other

Tables

Share

Share

Copy the content Link

Share with email

Email a colleague

Share on social media

The SIAM Publications Library now uses SIAM Single Sign-On for individuals. If you do not have existing SIAM credentials, create your SIAM account https://my.siam.org.