Morphisms of Neural Codes
From MaRDI portal
Publication:5215536
DOI10.1137/18M1205509zbMath1453.94155arXiv1806.02014WikidataQ114615472 ScholiaQ114615472MaRDI QIDQ5215536
Publication date: 12 February 2020
Published in: SIAM Journal on Applied Algebra and Geometry (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1806.02014
Other problems of combinatorial convexity (52A37) Combinatorial codes (94B25) Convex sets without dimension restrictions (aspects of convex geometry) (52A05)
Related Items (8)
Nondegenerate Neural Codes and Obstructions to Closed-Convexity ⋮ Oriented matroids and combinatorial neural codes ⋮ Non-monotonicity of closed convexity in neural codes ⋮ Polarization of neural codes ⋮ Erratum for “Morphisms of Neural Codes ⋮ Open, closed, and non-degenerate embedding dimensions of neural codes ⋮ Wheels: a new criterion for non-convexity of neural codes ⋮ Embedding dimension phenomena in intersection complete codes
Cites Work
- The neural ring: an algebraic tool for analyzing the intrinsic structure of neural codes
- Obstructions to convexity in neural codes
- Graph minors. XX: Wagner's conjecture
- Homomorphisms preserving neural ideals
- Neural ideals and stimulus space visualization
- On open and closed convex codes
- Sunflowers of convex open sets
- Neural Codes, Decidability, and a New Local Obstruction to Convexity
- Neural Ring Homomorphisms and Maps Between Neural Codes
- Polarization of neural rings
- A No-Go Theorem for One-Layer Feedforward Networks
- What Makes a Neural Code Convex?
- Oriented matroids and combinatorial neural codes
This page was built for publication: Morphisms of Neural Codes
