The minimum distance of sets of points and the minimum socle degree
Stefan O. Tohaneanu

TL;DR
This paper generalizes a lower bound on the minimum distance of point sets in projective space, linking it to the minimal free resolution of their defining ideals, and proves the bound's sharpness for certain cases.
Contribution
It extends previous results to all dimensions n≥2, establishing a universal lower bound on the minimum distance based on the minimal free resolution.
Findings
The lower bound d(Γ) ≥ A_n holds for all n ≥ 2.
The bound is sharp for specific classes of examples.
The result connects algebraic invariants with geometric properties.
Abstract
Let be a field of characteristic 0. Let be a reduced finite set of points, not all contained in a hyperplane. Let be the maximum number of points of contained in any hyperplane, and let . If is the ideal of , then in \cite{t1} it is shown that for , has a lower bound expressed in terms of some shift in the graded minimal free resolution of . In these notes we show that this behavior is true in general, for any : , where and is the last module in the graded minimal free resolution of . In the end we also prove that this bound is sharp for a whole class of examples due to Juan Migliore (\cite{m}).
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsCommutative Algebra and Its Applications · Polynomial and algebraic computation · Algebraic Geometry and Number Theory
