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-”
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.