Obstructions to convexity in neural codes
From MaRDI portal
Publication:504424
DOI10.1016/J.AAM.2016.11.006zbMATH Open1353.05132arXiv1509.03328OpenAlexW3104100870WikidataQ57426806 ScholiaQ57426806MaRDI QIDQ504424FDOQ504424
Authors: Caitlin Lienkaemper, Anne Shiu, Zev C. Woodstock 
Publication date: 16 January 2017
Published in: Advances in Applied Mathematics (Search for Journal in Brave)
Abstract: How does the brain encode spatial structure? One way is through hippocampal neurons called place cells, which become associated to convex regions of space known as their receptive fields: each place cell fires at a high rate precisely when the animal is in the receptive field. The firing patterns of multiple place cells form what is known as a convex neural code. How can we tell when a neural code is convex? To address this question, Giusti and Itskov identified a local obstruction, defined via the topology of a code's simplicial complex, and proved that convex neural codes have no local obstructions. Curto et al. proved the converse for all neural codes on at most four neurons. Via a counterexample on five neurons, we show that this converse is false in general. Additionally, we classify all codes on five neurons with no local obstructions. This classification is enabled by our enumeration of connected simplicial complexes on 5 vertices up to isomorphism. Finally, we examine how local obstructions are related to maximal codewords (maximal sets of neurons that co-fire). Curto et al. proved that a code has no local obstructions if and only if it contains certain "mandatory" intersections of maximal codewords. We give a new criterion for an intersection of maximal codewords to be non-mandatory, and prove that it classifies all such non-mandatory codewords for codes on up to 5 neurons.
Full work available at URL: https://arxiv.org/abs/1509.03328
Recommendations
- What makes a neural code convex?
- Neural Codes, Decidability, and a New Local Obstruction to Convexity
- Neural codes with three maximal codewords: convexity and minimal embedding dimension
- Strongly maximal intersection-complete neural codes on grids are convex
- Wheels: a new criterion for non-convexity of neural codes
Neural biology (92C20) Simplicial sets and complexes in algebraic topology (55U10) Combinatorial aspects of simplicial complexes (05E45)
Cites Work
- The On-Line Encyclopedia of Integer Sequences
- Practical graph isomorphism. II.
- Topics in Intersection Graph Theory
- Intersection patterns of convex sets
- The neural ring: an algebraic tool for analyzing the intrinsic structure of neural codes
- On open and closed convex codes
- Nerves, fibers and homotopy groups
- Intersection Patterns of Convex Sets via Simplicial Complexes: A Survey
- A no-go theorem for one-layer feedforward networks
- What makes a neural code convex?
Cited In (33)
- Morphisms of Neural Codes
- Oriented matroids and combinatorial neural codes
- On open and closed convex codes
- Canonical forms of neural ideals
- What makes a neural code convex?
- Open, closed, and non-degenerate embedding dimensions of neural codes
- Planar Convex Codes are Decidable
- What can topology tell us about the neural code?
- Hyperplane Neural Codes and the Polar Complex
- Polarization of neural rings
- Homomorphisms preserving neural ideals
- Every binary code can be realized by convex sets
- Non-monotonicity of closed convexity in neural codes
- Nondegenerate Neural Codes and Obstructions to Closed-Convexity
- Strongly maximal intersection-complete neural codes on grids are convex
- Gröbner bases of convex neural code ideals (research)
- Neural ring homomorphisms and maps between neural codes
- Wheels: a new criterion for non-convexity of neural codes
- Realizing convex codes with axis-parallel boxes
- Neural codes with three maximal codewords: convexity and minimal embedding dimension
- Periodic neural codes and sound localization in barn owls
- Neural Codes, Decidability, and a New Local Obstruction to Convexity
- Signless normalized Laplacian for hypergraphs
- Embedding dimension phenomena in intersection complete codes
- Minimal embedding dimensions of connected neural codes
- Classification of open and closed convex codes on five neurons
- Neural codes and the factor complex
- The combinatorial code and the graph rules of dale networks
- Sunflowers of convex open sets
- Neural ideals and stimulus space visualization
- Algebraic signatures of convex and non-convex codes
- Sparse neural codes and convexity
- Gröbner bases of neural ideals
Uses Software
This page was built for publication: Obstructions to convexity in neural codes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q504424)
