Neural codes with three maximal codewords: convexity and minimal embedding dimension
From MaRDI portal
Publication:2163062
DOI10.2140/involve.2022.15.333zbMath1497.92009arXiv2008.13192MaRDI QIDQ2163062
Anne Shiu, Clare Spinner, Katherine G. Johnston
Publication date: 9 August 2022
Published in: Involve (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2008.13192
92B20: Neural networks for/in biological studies, artificial life and related topics
52A20: Convex sets in (n) dimensions (including convex hypersurfaces)
05E45: Combinatorial aspects of simplicial complexes
Related Items
Cites Work
- The neural ring: an algebraic tool for analyzing the intrinsic structure of neural codes
- Obstructions to convexity in neural codes
- Neural ideals and stimulus space visualization
- On open and closed convex codes
- Sparse neural codes and convexity
- Convex Union Representability and Convex Codes
- Neural Codes, Decidability, and a New Local Obstruction to Convexity
- A No-Go Theorem for One-Layer Feedforward Networks
- What Makes a Neural Code Convex?