The minimum distance of sets of points and the minimum socle degree
From MaRDI portal
Publication:640923
Syzygies, resolutions, complexes and commutative rings (13D02) Hilbert-Samuel and Hilbert-Kunz functions; Poincaré series (13D40) Applications to coding theory and cryptography of arithmetic geometry (14G50) Geometric methods (including applications of algebraic geometry) applied to coding theory (94B27)
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}).
Recommendations
Cites work
- scientific article; zbMATH DE number 671739 (Why is no real title available?)
- scientific article; zbMATH DE number 671742 (Why is no real title available?)
- scientific article; zbMATH DE number 2216752 (Why is no real title available?)
- A symbolic test for \((i,j)\)-uniformity in reduced zero-dimensional schemes
- Algebraic geometric codes. Basic notions
- Cayley-Bacharach and evaluation codes on complete intersections
- If the socle fits
- Lower bounds on minimal distance of evaluation codes
- On the Cohen-Macaulay type of s-lines in \(A^{n+1}\)
- On the De Boer-Pellikaan method for computing minimum distance
- Sets of points and their conductor
- The Geometry of Syzygies
- The Hilbert Function of a Reduced K -Algebra
Cited in
(6)- On the minimum distance determined by \(n(\leq 7)\) points in an isoscele right triangle
- A commutative algebraic approach to the fitting problem
- Minimally distant sets of lattice points
- Steiner systems and configurations of points
- Bounding invariants of fat points using a coding theory construction
- Minimum distance of linear codes and the \(\alpha\)-invariant
This page was built for publication: The minimum distance of sets of points and the minimum socle degree
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q640923)