Order-forcing in neural codes

DOI10.1007/S00454-025-00760-3MaRDI QIDQ6879014zbMATH OpenFDO

Authors R. Amzi Jeffs, Caitlin Lienkaemper, Nora Youngs

Publication date 5 January 2026

Published in Discrete \& Computational Geometry (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.1007/S00454-025-00760-3

zbMATH Keywords

convexintersection patternneural coding

Mathematics Subject Classification ID

Combinatorial aspects of simplicial complexes (05E45) Planar arrangements of lines and pseudolines (aspects of discrete geometry) (52C30) Neural biology (92C20)

Cites work

• A no-go theorem for one-layer feedforward networks
• Classification of open and closed convex codes on five neurons
• Convex union representability and convex codes
• Embedding dimension phenomena in intersection complete codes
• Intersection Patterns of Convex Sets via Simplicial Complexes: A Survey
• Morphisms of Neural Codes
• Neural codes, decidability, and a new local obstruction to convexity
• Non-monotonicity of closed convexity in neural codes
• Nondegenerate Neural Codes and Obstructions to Closed-Convexity
• Obstructions to convexity in neural codes
• On open and closed convex codes
• Oriented matroids and combinatorial neural codes
• Sparse neural codes and convexity
• Sunflowers of convex open sets
• The complexity of point configurations
• The neural ring: an algebraic tool for analyzing the intrinsic structure of neural codes

This page was built for publication: Order-forcing in neural codes

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