The minimum distance of sets of points and the minimum socle degree

Abstract

Let K be a field of characteristic 0. Let ⊂ Pn K be a reduced finite set of points, not all contained in a hyperplane. Let hyp() be the maximum number of points of contained in any hyperplane, and let d()=||-hyp(). If I⊂ R= K[x0,...,xn] is the ideal of , then in t1 it is shown that for n=2,3, d() has a lower bound expressed in terms of some shift in the graded minimal free resolution of R/I. In these notes we show that this behavior is true in general, for any n≥ 2: d()≥ An, where An=\ai-n\ and i R(-ai) is the last module in the graded minimal free resolution of R/I. In the end we also prove that this bound is sharp for a whole class of examples due to Juan Migliore (m).

0

Turn this paper into a lesson

ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…