Morphisms of Neural Codes
From MaRDI portal
Publication:5215536
DOI10.1137/18M1205509zbMATH Open1453.94155arXiv1806.02014WikidataQ114615472 ScholiaQ114615472MaRDI QIDQ5215536FDOQ5215536
Authors: R. Amzi Jeffs 
Publication date: 12 February 2020
Published in: SIAM Journal on Applied Algebra and Geometry (Search for Journal in Brave)
Abstract: We define a notion of morphism between combinatorial codes, making the class of all combinatorial codes into a category . We show that morphisms can be used to remove redundant information from a code, and that morphisms preserve convexity. This fact leads us to define "minimally non-convex" codes. We propose a program to characterize these minimal obstructions to convexity and hence characterize all convex codes. We implement a library of Sage code to perform computation with morphisms. These computational methods yield the smallest to-date example of a non-convex code with no local obstructions. We conclude by giving an algebraic formulation of our results.
Full work available at URL: https://arxiv.org/abs/1806.02014
Recommendations
- Neural ring homomorphisms and maps between neural codes
- Some remarks about trunks and morphisms of neural codes
- Erratum to: ``Morphisms of neural codes
- Neural codes and the factor complex
- Combinatorial neural codes from a mathematical coding theory perspective
- Arithmetic codes resembling neural encoding
- Polarization of neural codes
- Neural Codes, Decidability, and a New Local Obstruction to Convexity
- Obstructions to convexity in neural codes
Combinatorial codes (94B25) Other problems of combinatorial convexity (52A37) Convex sets without dimension restrictions (aspects of convex geometry) (52A05)
Cites Work
- Graph minors. XX: Wagner's conjecture
- The neural ring: an algebraic tool for analyzing the intrinsic structure of neural codes
- On open and closed convex codes
- Obstructions to convexity in neural codes
- A no-go theorem for one-layer feedforward networks
- What makes a neural code convex?
- Homomorphisms preserving neural ideals
- Neural ring homomorphisms and maps between neural codes
- Neural ideals and stimulus space visualization
- Neural Codes, Decidability, and a New Local Obstruction to Convexity
- Sunflowers of convex open sets
- Polarization of neural rings
- Oriented matroids and combinatorial neural codes
Cited In (15)
- Oriented matroids and combinatorial neural codes
- Title not available (Why is that?)
- Open, closed, and non-degenerate embedding dimensions of neural codes
- Some remarks about trunks and morphisms of neural codes
- Hyperplane Neural Codes and the Polar Complex
- Homomorphisms preserving neural ideals
- Non-monotonicity of closed convexity in neural codes
- Nondegenerate Neural Codes and Obstructions to Closed-Convexity
- Wheels: a new criterion for non-convexity of neural codes
- Realizing convex codes with axis-parallel boxes
- Erratum to: ``Morphisms of neural codes
- Embedding dimension phenomena in intersection complete codes
- Neural codes and the factor complex
- Polarization of neural codes
- Indices for Testing Neural Codes
This page was built for publication: Morphisms of Neural Codes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5215536)
