What makes a neural code convex?
From MaRDI portal
Abstract: Neural codes allow the brain to represent, process, and store information about the world. Combinatorial codes, comprised of binary patterns of neural activity, encode information via the collective behavior of populations of neurons. A code is called convex if its codewords correspond to regions defined by an arrangement of convex open sets in Euclidean space. Convex codes have been observed experimentally in many brain areas, including sensory cortices and the hippocampus, where neurons exhibit convex receptive fields. What makes a neural code convex? That is, how can we tell from the intrinsic structure of a code if there exists a corresponding arrangement of convex open sets? In this work, we provide a complete characterization of local obstructions to convexity. This motivates us to define max intersection-complete codes, a family guaranteed to have no local obstructions. We then show how our characterization enables one to use free resolutions of Stanley-Reisner ideals in order to detect violations of convexity. Taken together, these results provide a significant advance in understanding the intrinsic combinatorial properties of convex codes.
Recommendations
Cites work
- d-representability of simplicial complexes of fixed dimension
- A no-go theorem for one-layer feedforward networks
- Characterization of f-vectors of families of convex sets in \({\mathbb{R}}^ d\). I: Necessity of Eckhoff's conditions
- Characterization of f-vectors of families of convex sets in \({\mathbb{R}}^ d\). II: Sufficiency of Eckhoff's conditions
- Clique topology reveals intrinsic geometric structure in neural correlations
- Combinatorial Commutative Algebra
- Combinatorial neural codes from a mathematical coding theory perspective
- scientific article; zbMATH DE number 2103273 (Why is no real title available?)
- scientific article; zbMATH DE number 5264892 (Why is no real title available?)
- Intersection patterns of convex sets
- Intersection Patterns of Convex Sets via Simplicial Complexes: A Survey
- Obstructions to convexity in neural codes
- On open and closed convex codes
- Recognition of collapsible complexes is NP-complete
- The neural ring: an algebraic tool for analyzing the intrinsic structure of neural codes
- What makes a neural code convex?
Cited in
(42)- Homomorphisms preserving neural ideals
- Every binary code can be realized by convex sets
- Neural ideals and stimulus space visualization
- On open and closed convex codes
- Embedding dimension phenomena in intersection complete codes
- Non-monotonicity of closed convexity in neural codes
- Neural codes with three maximal codewords: convexity and minimal embedding dimension
- Periodic neural codes and sound localization in barn owls
- Classification of open and closed convex codes on five neurons
- Neural codes and the factor complex
- Sunflowers of convex open sets
- Strongly maximal intersection-complete neural codes on grids are convex
- Algebraic signatures of convex and non-convex codes
- Sparse neural codes and convexity
- Minimal embedding dimensions of connected neural codes
- What can topology tell us about the neural code?
- Convex union representability and convex codes
- Gröbner bases of neural ideals
- Neural codes, decidability, and a new local obstruction to convexity
- Polarization of neural codes
- The why, how, and when of representations for complex systems
- Permitted sets and convex coding in nonthreshold linear networks
- Obstructions to convexity in neural codes
- Signless normalized Laplacian for hypergraphs
- Neural ring homomorphisms and maps between neural codes
- Hyperplane Neural Codes and the Polar Complex
- Gröbner bases of convex neural code ideals (research)
- Polarization of neural rings
- Morphisms of Neural Codes
- Combinatorial neural codes from a mathematical coding theory perspective
- A no-go theorem for one-layer feedforward networks
- What makes a neural code convex?
- Nondegenerate Neural Codes and Obstructions to Closed-Convexity
- Oriented matroids and combinatorial neural codes
- Open, closed, and non-degenerate embedding dimensions of neural codes
- Planar Convex Codes are Decidable
- Wheels: a new criterion for non-convexity of neural codes
- Canonical forms of neural ideals
- Realizing convex codes with axis-parallel boxes
- The combinatorial code and the graph rules of dale networks
- Neural codes and neural ring endomorphisms
- Embedding dimension gaps in sparse codes
This page was built for publication: What makes a neural code convex?
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5737775)
