Neural ring homomorphisms and maps between neural codes

DOI10.1007/978-3-030-43408-3_7MaRDI QIDQ5118364zbMATH OpenOpenAlexFDO

Authors Nora Youngs, Carina Curto

Publication date 8 September 2020

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

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

zbMATH Keywords

neural codestopological data analysis

Mathematics Subject Classification ID

Persistent homology and applications, topological data analysis (55N31) Applications of statistics to biology and medical sciences; meta analysis (62P10) Topological data analysis (62R40)

Abstract: Neural codes are binary codes that are used for information processing and representation in the brain. In previous work, we have shown how an algebraic structure, called the {it neural ring}, can be used to efficiently encode geometric and combinatorial properties of a neural code [1]. In this work, we consider maps between neural codes and the associated homomorphisms of their neural rings. In order to ensure that these maps are meaningful and preserve relevant structure, we find that we need additional constraints on the ring homomorphisms. This motivates us to define {it neural ring homomorphisms}. Our main results characterize all code maps corresponding to neural ring homomorphisms as compositions of 5 elementary code maps. As an application, we find that neural ring homomorphisms behave nicely with respect to convexity. In particular, if $mathcalC$ and $mathcalD$ are convex codes, the existence of a surjective code map $mathcalCightarrowmathcalD$ with a corresponding neural ring homomorphism implies that the minimal embedding dimensions satisfy $d(mathcalD)leqd(mathcalC)$.

Recommendations

• The neural ring: an algebraic tool for analyzing the intrinsic structure of neural codes
• Some remarks about trunks and morphisms of neural codes
• Homomorphisms preserving neural ideals
• Neural codes with three maximal codewords: convexity and minimal embedding dimension
• What makes a neural code convex?

Cites work

• A no-go theorem for one-layer feedforward networks
• Algebraic signatures of convex and non-convex codes
• Combinatorial neural codes from a mathematical coding theory perspective
• Homomorphisms preserving neural ideals
• scientific article; zbMATH DE number 3214278 (Why is no real title available?)
• Obstructions to convexity in neural codes
• On open and closed convex codes
• The neural ring: an algebraic tool for analyzing the intrinsic structure of neural codes
• What can topology tell us about the neural code?
• What makes a neural code convex?

Cited in

(10)

• Homomorphisms preserving neural ideals
• Neural ideals in SageMath
• Indices for Testing Neural Codes
• The neural ring: an algebraic tool for analyzing the intrinsic structure of neural codes
• Analysis of combinatorial neural codes: an algebraic approach
• Hyperplane Neural Codes and the Polar Complex
• Some remarks about trunks and morphisms of neural codes
• Morphisms of Neural Codes
• A no-go theorem for one-layer feedforward networks
• Neural codes and neural ring endomorphisms

This page was built for publication: Neural ring homomorphisms and maps between neural codes

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