Non-monotonicity of closed convexity in neural codes
From MaRDI portal
Publication:2135080
DOI10.1007/s10013-021-00521-8OpenAlexW3200777149MaRDI QIDQ2135080
R. Amzi Jeffs, Brianna Gambacini, Anne Shiu, Sam Macdonald
Publication date: 4 May 2022
Published in: Vietnam Journal of Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1912.00963
Simplicial sets and complexes in algebraic topology (55U10) Theory of error-correcting codes and error-detecting codes (94Bxx)
Related Items
Nondegenerate Neural Codes and Obstructions to Closed-Convexity ⋮ Open, closed, and non-degenerate embedding dimensions of neural codes
Cites Work
- The neural ring: an algebraic tool for analyzing the intrinsic structure of neural codes
- Obstructions to convexity in neural codes
- Every binary code can be realized by convex sets
- On open and closed convex codes
- Embedding dimension phenomena in intersection complete codes
- Classification of open and closed convex codes on five neurons
- Sunflowers of convex open sets
- Strongly maximal intersection-complete neural codes on grids are convex
- Sparse neural codes and convexity
- Intersection Patterns of Convex Sets via Simplicial Complexes: A Survey
- Convex Union Representability and Convex Codes
- Neural Codes, Decidability, and a New Local Obstruction to Convexity
- Hyperplane Neural Codes and the Polar Complex
- Morphisms of Neural Codes
- A No-Go Theorem for One-Layer Feedforward Networks
- What Makes a Neural Code Convex?
