English

Embedding dimension gaps in sparse codes

Combinatorics 2023-09-27 v1

Abstract

We study the open and closed embedding dimensions of a convex 3-sparse code FP\mathcal{FP}, which records the intersection pattern of lines in the Fano plane. We show that the closed embedding dimension of FP\mathcal{FP} 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 two" 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

Cite

@article{arxiv.2309.14862,
  title  = {Embedding dimension gaps in sparse codes},
  author = {R. Amzi Jeffs and Henry Siegel and David Staudinger and Yiqing Wang},
  journal= {arXiv preprint arXiv:2309.14862},
  year   = {2023}
}

Comments

16 pages, 8 figures

R2 v1 2026-06-28T12:32:40.225Z