The neural ring: an algebraic tool for analyzing the intrinsic structure of neural codes
From MaRDI portal
Publication:372050
DOI10.1007/s11538-013-9860-3zbMath1311.92043arXiv1212.4201OpenAlexW2104874563WikidataQ51200259 ScholiaQ51200259MaRDI QIDQ372050
Alan Veliz-Cuba, Carina Curto, Nora Youngs, Vladimir Itskov
Publication date: 11 October 2013
Published in: Bulletin of Mathematical Biology (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1212.4201
Related Items
Geometric and probabilistic limit theorems in topological data analysis, Nondegenerate Neural Codes and Obstructions to Closed-Convexity, Oriented matroids and combinatorial neural codes, Semantic spaces, Non-monotonicity of closed convexity in neural codes, Homomorphisms preserving neural ideals, Signless normalized Laplacian for hypergraphs, Polarization of neural codes, Every binary code can be realized by convex sets, What can topology tell us about the neural code?, Neural codes with three maximal codewords: convexity and minimal embedding dimension, Periodic neural codes and sound localization in barn owls, Minimal embedding dimensions of connected neural codes, Gröbner bases of neural ideals, Error-correcting codes and neural networks, Hodge-Kodaira decomposition of evolving neural networks, Algebraic signatures of convex and non-convex codes, Primary decomposition of squarefree pseudomonomial ideals, Sparse neural codes and convexity, Neural ideals and stimulus space visualization, 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, The case for algebraic biology: from research to education, Neural Ring Homomorphisms and Maps Between Neural Codes, Hyperplane Neural Codes and the Polar Complex, Gröbner Bases of Convex Neural Code Ideals (Research), Encoding Binary Neural Codes in Networks of Threshold-Linear Neurons, On open and closed convex codes, Polarization of neural rings, A No-Go Theorem for One-Layer Feedforward Networks, Tropical coordinates on the space of persistence barcodes, Neural Codes, Decidability, and a New Local Obstruction to Convexity, Obstructions to convexity in neural codes, Persistent topology of syntax, Geometric characterization of data sets with unique reduced Gröbner bases, What Makes a Neural Code Convex?, Classification of open and closed convex codes on five neurons, Morphisms of Neural Codes, Neural codes and the factor complex, Embedding dimension phenomena in intersection complete codes, Tropical Sufficient Statistics for Persistent Homology, State polytopes related to two classes of combinatorial neural codes, Sunflowers of convex open sets, Strongly maximal intersection-complete neural codes on grids are convex, Certificate complexity and symmetry of nested canalizing functions
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Siphons in chemical reaction 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
- Reverse-engineering of polynomial dynamical systems
- An Algebraic Approach to Reverse Engineering Finite Dynamical Systems Arising from Biology
- Computations in algebraic geometry with Macaulay 2
