Nondegenerate Neural Codes and Obstructions to Closed-Convexity

DOI10.1137/21M1452147MaRDI QIDQ5883278

Unnamed Author, Patrick P. K. Chan, Anne Shiu, Alexander Ruys de Perez, Katherine G. Johnston

Publication date: 30 March 2023

Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)

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

zbMATH Keywords

simplicial complex; convex; embedding dimension; neural code

Mathematics Subject Classification ID

92C20: Neural biology

13F20: Polynomial rings and ideals; rings of integer-valued polynomials

52A20: Convex sets in (n) dimensions (including convex hypersurfaces)

05E45: Combinatorial aspects of simplicial complexes

Related Items

Open, closed, and non-degenerate embedding dimensions of neural codes, Wheels: a new criterion for non-convexity of neural codes

Uses Software

• neural ideal

Cites Work

• The neural ring: an algebraic tool for analyzing the intrinsic structure of neural codes
• Obstructions to convexity in neural codes
• Homomorphisms preserving neural ideals
• Neural ideals in SageMath
• On open and closed convex codes
• Embedding dimension phenomena in intersection complete codes
• Non-monotonicity of closed convexity in neural codes
• Classification of open and closed convex codes on five neurons
• Neural codes and the factor complex
• Sunflowers of convex open sets
• Algebraic signatures of convex and non-convex codes
• Convex Union Representability and Convex Codes
• Gröbner bases of neural ideals
• Neural Codes, Decidability, and a New Local Obstruction to Convexity
• Morphisms of Neural Codes
• Strengthening Relationships between Neural Ideals and Receptive Fields
• A No-Go Theorem for One-Layer Feedforward Networks
• What Makes a Neural Code Convex?