What Makes a Neural Code Convex?
From MaRDI portal
Publication:5737775
DOI10.1137/16M1073170zbMath1362.92012arXiv1508.00150OpenAlexW2963014315MaRDI QIDQ5737775
Zvi Rosen, Jack Jeffries, Katherine Morrison, Nora Youngs, Anne Shiu, Elizabeth Gross, Mohamed Omar, Carina Curto
Publication date: 30 May 2017
Published in: SIAM Journal on Applied Algebra and Geometry (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1508.00150
Neural biology (92C20) Combinatorial codes (94B25) Applications of commutative algebra (e.g., to statistics, control theory, optimization, etc.) (13P25)
Related Items
Nondegenerate Neural Codes and Obstructions to Closed-Convexity ⋮ Non-monotonicity of closed convexity in neural codes ⋮ Homomorphisms preserving neural ideals ⋮ Signless normalized Laplacian for hypergraphs ⋮ Polarization of neural codes ⋮ Every binary code can be realized by convex sets ⋮ What can topology tell us about the neural code? ⋮ Neural codes with three maximal codewords: convexity and minimal embedding dimension ⋮ Periodic neural codes and sound localization in barn owls ⋮ Minimal embedding dimensions of connected neural codes ⋮ Gröbner bases of neural ideals ⋮ Algebraic signatures of convex and non-convex codes ⋮ Sparse neural codes and convexity ⋮ Neural ideals and stimulus space visualization ⋮ Open, closed, and non-degenerate embedding dimensions of neural codes ⋮ Planar Convex Codes are Decidable ⋮ Wheels: a new criterion for non-convexity of neural codes ⋮ Neural Ring Homomorphisms and Maps Between Neural Codes ⋮ Hyperplane Neural Codes and the Polar Complex ⋮ Gröbner Bases of Convex Neural Code Ideals (Research) ⋮ On open and closed convex codes ⋮ Polarization of neural rings ⋮ Neural Codes, Decidability, and a New Local Obstruction to Convexity ⋮ Obstructions to convexity in neural codes ⋮ What Makes a Neural Code Convex? ⋮ Classification of open and closed convex codes on five neurons ⋮ Morphisms of Neural Codes ⋮ Neural codes and the factor complex ⋮ Embedding dimension phenomena in intersection complete codes ⋮ Sunflowers of convex open sets ⋮ Strongly maximal intersection-complete neural codes on grids are convex ⋮ The Why, How, and When of Representations for Complex Systems
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- The neural ring: an algebraic tool for analyzing the intrinsic structure of neural codes
- Obstructions to convexity in neural codes
- Intersection patterns of convex sets
- Characterization of f-vectors of families of convex sets in \({\mathbb{R}}^ d\). I: Necessity of Eckhoff's conditions
- Characterization of f-vectors of families of convex sets in \({\mathbb{R}}^ d\). II: Sufficiency of Eckhoff's conditions
- On open and closed convex codes
- Intersection Patterns of Convex Sets via Simplicial Complexes: A Survey
- Clique topology reveals intrinsic geometric structure in neural correlations
- $d$-representability of simplicial complexes of fixed dimension
- Combinatorial Commutative Algebra
- Combinatorial Neural Codes from a Mathematical Coding Theory Perspective
- A No-Go Theorem for One-Layer Feedforward Networks
- What Makes a Neural Code Convex?
- Recognition of collapsible complexes is NP-complete
This page was built for publication: What Makes a Neural Code Convex?
