Neural ring homomorphisms and maps between neural codes

DOI10.1007/978-3-030-43408-3_7zbMATH Open1448.62214arXiv1511.00255OpenAlexW3159316707MaRDI QIDQ5118364FDOQ5118364

Authors: Nora Youngs, Carina Curto 

Publication date: 8 September 2020

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

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)$.

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

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?

zbMATH Keywords

topological data analysisneural codes

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• 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?
• Combinatorial neural codes from a mathematical coding theory perspective
• What can topology tell us about the neural code?
• Homomorphisms preserving neural ideals
• Algebraic signatures of convex and non-convex codes

Cited In (9)

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

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)