Bounding invariants of fat points using a coding theory construction

DOI10.1016/J.JPAA.2012.06.004zbMATH Open1274.13029arXiv1108.1359OpenAlexW2039920053MaRDI QIDQ1946168FDOQ1946168

Adam Van Tuyl, Stefan O. Tohǎneanu

Publication date: 18 April 2013

Published in: Journal of Pure and Applied Algebra (Search for Journal in Brave)

Abstract: Let $Zsubseteqprojn$ 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., upper bounds) on some specific shifts in the graded minimal free resolution of $I_Z$, the defining ideal of $Z$. We investigate this relation in the case that the support of $Z$ is a complete intersection; when $Z$ is reduced and a complete intersection we give lower bounds for $d(Z)$ that improve upon known bounds.

Full work available at URL: https://arxiv.org/abs/1108.1359

zbMATH Keywords

Betti numberssocle degreecoding theoryfat point schemes

Mathematics Subject Classification ID

Syzygies, resolutions, complexes and commutative rings (13D02) Hilbert-Samuel and Hilbert-Kunz functions; Poincaré series (13D40) Geometric methods (including applications of algebraic geometry) applied to coding theory (94B27)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Using Algebraic Geometry
• Tropical algebraic geometry
• Cayley-Bacharach and evaluation codes on complete intersections
• The minimum distance of parameterized codes on projective tori
• Lower bounds on minimal distance of evaluation codes
• Linkage and codes on complete intersections
• The Hilbert Function of a Reduced K -Algebra
• If the socle fits
• Separators of fat points in \(\mathbb P^n\).
• Sets of points and their conductor
• Powers of complete intersections: Graded Betti numbers and applications
• A symbolic test for \((i,j)\)-uniformity in reduced zero-dimensional schemes
• The minimum distance of sets of points and the minimum socle degree
• Generalized Bezout's theorem and its applications in coding theory
• Linear Codes of Constant Weight

Cited In (11)

• Generalized minimum distance functions and algebraic invariants of Geramita ideals
• The second generalized Hamming weight of some evaluation codes arising from a projective torus
• Steiner systems and configurations of points
• Minimum distance functions of graded ideals and Reed-Muller-type codes
• Minimum distance functions of complete intersections
• Parameterized codes associated to the edges of some subgraphs of a simple graph
• Indicator functions, \(\mathrm{v}\)-numbers and Gorenstein rings in the theory of projective Reed-Muller-type codes
• Minimum distance of linear codes and the \(\alpha\)-invariant
• Fat points, partial intersections and Hamming distance
• A commutative algebraic approach to the fitting problem
• On ideals generated by \(a\)-fold products of linear forms

This page was built for publication: Bounding invariants of fat points using a coding theory construction

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1946168)