Neural codes and the factor complex

DOI10.1016/J.AAM.2019.101977MaRDI QIDQ2300577zbMATH OpenOpenAlexWikidataFDO

Authors Alexander Ruys de Perez, Laura Felicia Matusevich, Anne Shiu

Publication date 27 February 2020

Published in Advances in Applied Mathematics (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1904.03235

zbMATH Keywords

combinatoricscommutative algebracognitionneuronsStanley-Reisner

Mathematics Subject Classification ID

Neural biology (92C20) Combinatorial aspects of commutative algebra (05E40) Combinatorial aspects of simplicial complexes (05E45) Computational methods for problems pertaining to biology (92-08) Applications of the theory of convex sets and geometry of numbers (covering radius, etc.) to coding theory (94B75)

Abstract: We introduce the factor complex of a neural code, and show how intervals and maximal codewords are captured by the combinatorics of factor complexes. We use these results to obtain algebraic and combinatorial characterizations of max-intersection-complete codes, as well as a new combinatorial characterization of intersection-complete codes.

Recommendations

• Strongly maximal intersection-complete neural codes on grids are convex
• What makes a neural code convex?
• On open and closed convex codes
• Morphisms of Neural Codes
• The neural ring: an algebraic tool for analyzing the intrinsic structure of neural codes

Cites work

• Algebraic signatures of convex and non-convex codes
• An algebraic approach to reverse engineering finite dynamical systems arising from biology
• Convex union representability and convex codes
• Every binary code can be realized by convex sets
• Gröbner bases of neural ideals
• Neural ideals and stimulus space visualization
• Neural ideals in SageMath
• Obstructions to convexity in neural codes
• On open and closed convex codes
• Reverse-engineering of polynomial dynamical systems
• Sparse neural codes and convexity
• Strengthening relationships between neural ideals and receptive fields
• Strongly maximal intersection-complete neural codes on grids are convex
• The neural ring: an algebraic tool for analyzing the intrinsic structure of neural codes
• What makes a neural code convex?

Cited in

(17)

• Wheels: a new criterion for non-convexity of neural codes
• Gröbner bases of neural ideals
• Indices for Testing Neural Codes
• Canonical forms of neural ideals
• Gröbner bases of convex neural code ideals (research)
• Oriented matroids and combinatorial neural codes
• Algebraic network reconstruction of discrete dynamical systems
• State polytopes related to two classes of combinatorial neural codes
• Polarization of neural codes
• The neural ring: an algebraic tool for analyzing the intrinsic structure of neural codes
• Hyperplane Neural Codes and the Polar Complex
• Embedding dimension phenomena in intersection complete codes
• Strengthening relationships between neural ideals and receptive fields
• Polarization of neural rings
• Nondegenerate Neural Codes and Obstructions to Closed-Convexity
• Algebraic signatures of convex and non-convex codes
• Morphisms of Neural Codes

Describes a project that uses

Uses Software

• neural ideal

This page was built for publication: Neural codes and the factor complex

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2300577)