Vol. 15, No. 2, 2022

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

Volume 15
Issue 2, 185–365
Issue 1, 1–184

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
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
Neural codes with three maximal codewords: convexity and minimal embedding dimension

Katherine Johnston, Anne Shiu and Clare Spinner

Vol. 15 (2022), No. 2, 333–343

Neural codes, represented as collections of binary strings called codewords, are used to encode neural activity. A code is called convex if its codewords are represented as an arrangement of convex open sets in Euclidean space. Previous work has focused on addressing the question: how can we tell when a neural code is convex? Giusti and Itskov (Neural Comput. 26:11 (2014), 2527–2540) identified a local obstruction and proved that convex neural codes have no local obstructions. The converse is true for codes on up to four neurons, but false in general. Nevertheless, we prove that this converse holds for codes with up to three maximal codewords, and, moreover, the minimal embedding dimension of such codes is at most 2.

neural codes, convex, simplicial complex, link, contractible
Mathematical Subject Classification
Primary: 05E45, 52A20
Secondary: 92C20
Received: 4 June 2021
Revised: 15 September 2021
Accepted: 22 September 2021
Published: 29 July 2022

Communicated by Anant Godbole
Katherine Johnston
Lafayette College
Easton, PA
United States
Anne Shiu
Department of Mathematics
Texas A&M University
College Station, TX
United States
Clare Spinner
University of Portland
Portland, OR
United States