Strongly maximal intersection-complete neural codes on grids are convex

Robert Williams

Applied Mathematics and Computation, 2018, vol. 336, issue C, 162-175

Abstract: The brain encodes spatial structure through a combinatorial code of neural activity. Experiments suggest such codes correspond to convex areas of the subject’s environment. We present an intrinsic condition that implies a neural code may correspond to a collection of convex sets and give a bound on the minimal dimension underlying such a realization.

Keywords: Neural code; Convex code; Intersection-complete; Grid (search for similar items in EconPapers)
Date: 2018
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S0096300318303904
Full text for ScienceDirect subscribers only

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:eee:apmaco:v:336:y:2018:i:c:p:162-175

DOI: 10.1016/j.amc.2018.04.064

Access Statistics for this article

Applied Mathematics and Computation is currently edited by Theodore Simos

More articles in Applied Mathematics and Computation from Elsevier
Bibliographic data for series maintained by Catherine Liu ().