Bounding invariants of fat points using a coding theory construction

Stefan O. Tohaneanu, Adam Van Tuyl

Let $Z \subseteq \proj{n}$ be a fat points scheme, and let $d(Z)$ be the minimum distance of the linear code constructed from $Z$. We show that $d(Z)$ imposes constraints (i.e., up…