Vol. 12, No. 5, 2019

Download this article
Download this article For screen
For printing
Recent Issues

Volume 17, 1 issue

Volume 16, 5 issues

Volume 15, 5 issues

Volume 14, 5 issues

Volume 13, 5 issues

Volume 12, 8 issues

Volume 11, 5 issues

Volume 10, 5 issues

Volume 9, 5 issues

Volume 8, 5 issues

Volume 7, 6 issues

Volume 6, 4 issues

Volume 5, 4 issues

Volume 4, 4 issues

Volume 3, 4 issues

Volume 2, 5 issues

Volume 1, 2 issues

The Journal
About the Journal
Editorial Board
Editors’ Interests
Subscriptions
 
Submission Guidelines
Submission Form
Policies for Authors
Ethics Statement
 
ISSN: 1944-4184 (e-only)
ISSN: 1944-4176 (print)
Author Index
Coming Soon
 
Other MSP Journals
This article is available for purchase or by subscription. See below.
Sparse neural codes and convexity

R. Amzi Jeffs, Mohamed Omar, Natchanon Suaysom, Aleina Wachtel and Nora Youngs

Vol. 12 (2019), No. 5, 737–754
Abstract

Determining how the brain stores information is one of the most pressing problems in neuroscience. In many instances, the collection of stimuli for a given neuron can be modeled by a convex set in d . Combinatorial objects known as neural codes can then be used to extract features of the space covered by these convex regions. We apply results from convex geometry to determine which neural codes can be realized by arrangements of open convex sets. We restrict our attention primarily to sparse codes in low dimensions. We find that intersection-completeness characterizes realizable 2-sparse codes, and show that any realizable 2-sparse code has embedding dimension at most 3. Furthermore, we prove that in 2 and 3 , realizations of 2-sparse codes using closed sets are equivalent to those with open sets, and this allows us to provide some preliminary results on distinguishing which 2-sparse codes have embedding dimension at most 2.

PDF Access Denied

We have not been able to recognize your IP address 3.138.199.50 as that of a subscriber to this journal.
Online access to the content of recent issues is by subscription, or purchase of single articles.

Please contact your institution's librarian suggesting a subscription, for example by using our journal-recom­mendation form. Or, visit our subscription page for instructions on purchasing a subscription.

You may also contact us at contact@msp.org
or by using our contact form.

Or, you may purchase this single article for USD 30.00:

Keywords
neural code, sparse, convexity
Mathematical Subject Classification 2010
Primary: 05C62, 52A10, 92B20
Milestones
Received: 26 October 2017
Revised: 24 October 2018
Accepted: 5 December 2018
Published: 22 May 2019

Communicated by Ann N. Trenk
Authors
R. Amzi Jeffs
Department of Mathematics
University of Washington
Seattle, WA
United States
Mohamed Omar
Department of Mathematics
Harvey Mudd College
Claremont, CA
United States
Natchanon Suaysom
Harvey Mudd College
Claremont, CA
United States
Aleina Wachtel
Harvey Mudd College
Claremont, CA
United States
Nora Youngs
Department of Mathematics and Statistics
Colby College
Waterville, ME
United States