Strongly maximal intersection-complete neural codes on grids are convex

摘要

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.