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

Volume 19
Issue 3, 361–540
Issue 2, 181–359
Issue 1, 1–179

Volume 18, 5 issues

Volume 17, 5 issues

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
Ethics and policies
Peer-review process
 
Submission guidelines
Submission form
Editorial board
Editors' interests
 
Subscriptions
 
ISSN 1944-4184 (online)
ISSN 1944-4176 (print)
 
Author index
To appear
 
Other MSP journals
Embedding dimension gaps in sparse codes

R. Amzi Jeffs, Henry Siegel, David Staudinger and Yiqing Wang

Vol. 19 (2026), No. 3, 405–422
Abstract

Every collection of convex sets can be associated to a combinatorial code recording the regions that the sets cut out in space, analogous to a Venn diagram. These “convex codes” have been studied as a mathematical model of hippocampal place cells, and a central question is to find criteria for bounding the minimal “embedding dimension” in which a given code can be realized. We study the open and closed embedding dimensions of a convex 3-sparse code 𝒫, which records the intersection pattern of lines in the Fano plane. We show that the closed embedding dimension of 𝒫 is three, and the open embedding dimension is between four and six, providing the first example of a 3-sparse code with closed embedding dimension three and differing open and closed embedding dimensions. We also investigate codes whose canonical form is quadratic, i.e., “degree-2” codes. We show that such codes are realizable by axis-parallel boxes, generalizing a recent result of Zhou on inductively pierced codes.

We pose several open questions regarding sparse and low-degree codes. In particular, we conjecture that the open embedding dimension of certain 3-sparse codes derived from Steiner triple systems grows to infinity.

Keywords
convex, code, sparse, embedding dimension, intersection pattern, $d$-representable
Mathematical Subject Classification
Primary: 52A20, 52C99
Milestones
Received: 7 June 2024
Revised: 8 September 2024
Accepted: 9 September 2024
Published: 12 June 2026

Communicated by Steven J. Miller
Authors
R. Amzi Jeffs
Department of Mathematical Sciences
Carnegie Mellon University
Pittsburgh, PA
United States
Henry Siegel
Department of Mathematical Sciences
Carnegie Mellon University
Pittsburgh, PA
United States
David Staudinger
Department of Mathematical Sciences
Carnegie Mellon University
Pittsburgh, PA
United States
Yiqing Wang
Department of Mathematics
University of Wisconsin-Madison
Madison, WI
United States