[[missing key: loading-pdf-error]] [[missing key: loading-pdf-link]]
Abstract
Neurons in the brain represent external stimuli via neural codes. These codes often arise from stimulus-response maps, associating to each neuron a convex receptive field. An important problem confronted by the brain is to infer properties of a represented stimulus space without knowledge of the receptive fields, using only the intrinsic structure of the neural code. How does the brain do this? To address this question, it is important to determine what stimulus space features can - in principle - be extracted from neural codes. This motivates us to define the neural ring and a related neural ideal, algebraic objects that encode the full combinatorial data of a neural code. We find that these objects can be expressed in a "canonical form" that directly translates to a minimal description of the receptive field structure intrinsic to the neural code. We consider the algebraic properties of homomorphisms between neural rings, which naturally relate to maps between neural codes. We show that maps between two neural codes are in bijection with ring homomorphisms between the respective neural rings, and define the notion of neural ring homomorphism, a special restricted class of ring homomorphisms which preserve neuron structure. We also find connections to Stanley-Reisner rings, and use ideas similar to those in the theory of monomial ideals to obtain an algorithm for computing the canonical form associated to any neural code, providing the groundwork for inferring stimulus space features from neural activity alone.
You have requested "on-the-fly" machine translation of selected content from our databases. This functionality is provided solely for your convenience and is in no way intended to replace human translation. Show full disclaimer
Neither ProQuest nor its licensors make any representations or warranties with respect to the translations. The translations are automatically generated "AS IS" and "AS AVAILABLE" and are not retained in our systems. PROQUEST AND ITS LICENSORS SPECIFICALLY DISCLAIM ANY AND ALL EXPRESS OR IMPLIED WARRANTIES, INCLUDING WITHOUT LIMITATION, ANY WARRANTIES FOR AVAILABILITY, ACCURACY, TIMELINESS, COMPLETENESS, NON-INFRINGMENT, MERCHANTABILITY OR FITNESS FOR A PARTICULAR PURPOSE. Your use of the translations is subject to all use restrictions contained in your Electronic Products License Agreement and by using the translation functionality you agree to forgo any and all claims against ProQuest or its licensors for your use of the translation functionality and any output derived there from. Hide full disclaimer





