Hyperplane Neural Codes and the Polar Complex

DOI10.1007/978-3-030-43408-3_13zbMath1451.92019arXiv1801.02304OpenAlexW3147934913MaRDI QIDQ5118374

Vladimir Itskov, A. B. Kunin, Zvi Rosen

Publication date: 8 September 2020

Published in: Topological Data Analysis (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1801.02304

zbMATH Keywords

neural networkshellabilitycombinatorial codeshyperplane codes

Mathematics Subject Classification ID

Neural networks for/in biological studies, artificial life and related topics (92B20) Discrete geometry (52C99)

Related Items (5)

Oriented matroids and combinatorial neural codes ⋮ Non-monotonicity of closed convexity in neural codes ⋮ Corners and simpliciality in oriented matroids and partial cubes ⋮ Neural Codes, Decidability, and a New Local Obstruction to Convexity ⋮ Embedding dimension phenomena in intersection complete codes

Uses Software

• Macaulay2

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The neural ring: an algebraic tool for analyzing the intrinsic structure of neural codes
• COMs: complexes of oriented matroids
• On open and closed convex codes
• The axiomatization of affine oriented matroids reassessed
• Shellable nonpure complexes and posets. II
• Gröbner bases of neural ideals
• Analysis of Combinatorial Neural Codes: An Algebraic Approach
• Neural Codes, Decidability, and a New Local Obstruction to Convexity
• Oriented Matroids
• A No-Go Theorem for One-Layer Feedforward Networks
• What Makes a Neural Code Convex?
• Combinatorial algebraic topology
• Approximation by superpositions of a sigmoidal function

This page was built for publication: Hyperplane Neural Codes and the Polar Complex