Morphisms of Neural Codes

DOI10.1137/18M1205509MaRDI QIDQ5215536zbMATH OpenWikidataFDO

Authors R. Amzi Jeffs

Publication date 12 February 2020

Published in SIAM Journal on Applied Algebra and Geometry (Search for Journal in Brave)

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

zbMATH Keywords

minimalcodeconvexmorphismobstructionneural

Mathematics Subject Classification ID

Combinatorial codes (94B25) Other problems of combinatorial convexity (52A37) Convex sets without dimension restrictions (aspects of convex geometry) (52A05)

Abstract: We define a notion of morphism between combinatorial codes, making the class of all combinatorial codes into a category $mathbfCode$. 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.

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

Cites work

• A no-go theorem for one-layer feedforward networks
• Graph minors. XX: Wagner's conjecture
• Homomorphisms preserving neural ideals
• Neural codes, decidability, and a new local obstruction to convexity
• Neural ideals and stimulus space visualization
• Neural ring homomorphisms and maps between neural codes
• Obstructions to convexity in neural codes
• On open and closed convex codes
• Oriented matroids and combinatorial neural codes
• Polarization of neural rings
• Sunflowers of convex open sets
• The neural ring: an algebraic tool for analyzing the intrinsic structure of neural codes
• What makes a neural code convex?

Cited in

(15)

• Oriented matroids and combinatorial neural codes
• scientific article; zbMATH DE number 6985563 (Why is no real title available?)
• Open, closed, and non-degenerate embedding dimensions of neural codes
• Some remarks about trunks and morphisms of neural codes
• Homomorphisms preserving neural ideals
• Hyperplane Neural Codes and the Polar Complex
• 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)