Oriented matroids and combinatorial neural codes

DOI10.5070/C63160427MaRDI QIDQ5886261zbMATH OpenFDO

Authors A. B. Kunin, Caitlin Lienkaemper, Zvi Rosen

Publication date 31 March 2023

Published in Combinatorial Theory (Search for Journal in Brave)

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

zbMATH Keywords

oriented matroidshyperplane arrangementsconvex neural codes

Mathematics Subject Classification ID

Oriented matroids in discrete geometry (52C40) Applications of commutative algebra (e.g., to statistics, control theory, optimization, etc.) (13P25)

Recommendations

• Morphisms of Neural Codes
• What makes a neural code convex?
• Neural codes, decidability, and a new local obstruction to convexity
• On open and closed convex codes
• Neural codes with three maximal codewords: convexity and minimal embedding dimension

Cites work

• scientific article; zbMATH DE number 4092241 (Why is no real title available?)
• scientific article; zbMATH DE number 17663 (Why is no real title available?)
• scientific article; zbMATH DE number 1241847 (Why is no real title available?)
• scientific article; zbMATH DE number 1889697 (Why is no real title available?)
• scientific article; zbMATH DE number 2190625 (Why is no real title available?)
• Algebraic signatures of convex and non-convex codes
• COMs: complexes of oriented matroids
• Classification of open and closed convex codes on five neurons
• Clique topology reveals intrinsic geometric structure in neural correlations
• Complexity of some geometric and topological problems
• Convex union representability and convex codes
• Convex, acyclic, and free sets of an oriented matroid
• Embedding dimension phenomena in intersection complete codes
• Hyperplane Neural Codes and the Polar Complex
• Lectures in real geometry. Elaborated versions of the lectures given at the winter school in real geometry, Madrid, Spain, January 3--7, 1994
• Minimal embedding dimensions of connected neural codes
• Morphisms of Neural Codes
• Nerves of good covers are algorithmically unrecognizable
• Neural codes and the factor complex
• Neural codes, decidability, and a new local obstruction to convexity
• Obstructions to convexity in neural codes
• On the decidability of Diophantine problems in combinatorial geometry
• Oriented Matroids
• Oriented matroids
• Polarization of neural rings
• Sunflowers of convex open sets
• Syzygies of oriented matroids
• The neural ring: an algebraic tool for analyzing the intrinsic structure of neural codes
• Yes, the ``missing axiom of matroid theory is lost forever
• \(D\)-collapsibility is NP-complete for \(d \geq 4\)

Cited in

(6)

• Open, closed, and non-degenerate embedding dimensions of neural codes
• Oriented Matroids and Combinatorial Neural Codes
• Planar Convex Codes are Decidable
• Convex union representability and convex codes
• Realizing convex codes with axis-parallel boxes
• Morphisms of Neural Codes

Describes a project that uses

Uses Software

• CliqueTop

This page was built for publication: Oriented matroids and combinatorial neural codes

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5886261)