Footprint and minimum distance functions
From MaRDI portal
Publication:4582785
DOI10.4134/CKMS.C170139zbMATH Open1401.13049arXiv1712.00387MaRDI QIDQ4582785FDOQ4582785
Authors: Luis Núñez-Betancourt, Yuriko Pitones, Rafael H. Villarreal
Publication date: 24 August 2018
Abstract: Let be a polynomial ring over a field , with a monomial order , and let be an unmixed graded ideal of . In this paper we study two functions associated to : the minimum distance function and the footprint function . It is shown that is positive and that is positive if the initial ideal of is unmixed. Then we show that if is radical and its associated primes are generated by linear forms, then is strictly decreasing until it reaches the asymptotic value . If is the edge ideal of a Cohen--Macaulay bipartite graph, we show that for greater than or equal to the regularity of . For a graded ideal of dimension , whose initial ideal is a complete intersection, we give an exact sharp lower bound for the corresponding minimum distance function.
Full work available at URL: https://arxiv.org/abs/1712.00387
Recommendations
Applications of commutative algebra (e.g., to statistics, control theory, optimization, etc.) (13P25) Hilbert-Samuel and Hilbert-Kunz functions; Poincaré series (13D40) Special types (Cohen-Macaulay, Gorenstein, Buchsbaum, etc.) (13H10)
Cites Work
- Hilbert functions of graded algebras
- Cohen-Macaulay graphs
- Distributive lattices, bipartite graphs and Alexander duality
- The Geometry of Syzygies
- Introduction to liaison theory and deficiency modules
- Title not available (Why is that?)
- On the second weight of generalized Reed-Muller codes
- Reed-Muller-type codes over the Segre variety
- On the second Hamming weight of some Reed-Muller type codes
- Title not available (Why is that?)
- Algebraic methods for parameterized codes and invariants of vanishing ideals over finite fields
- Degree and algebraic properties of lattice and matrix ideals
- Computational methods of commutative algebra and algebraic geometry. With chapters by David Eisenbud, Daniel R. Grayson, Jürgen Herzog and Michael Stillman
- Regularity of lex-segment ideals: Some closed formulas and applications
- On the structure of order domains
- Minimum distance functions of graded ideals and Reed-Muller-type codes
- Regularity, depth and arithmetic rank of bipartite edge ideals
- Covering the cube by affine hyperplanes
- Characteristic-independence of Betti numbers of graph ideals
- Evaluation codes from an affine variety code perspective
- Footprints or generalized Bezout's theorem
Cited In (10)
- Regularity index of the generalized minimum distance function
- The \(v\)-number of edge ideals
- Generalized minimum distance functions
- Generalized minimum distance functions and algebraic invariants of Geramita ideals
- Connected domination in graphs and \(v\)-numbers of binomial edge ideals
- Minimum distance functions of complete intersections
- On the v-number of Gorenstein ideals and Frobenius powers
- Relative generalized Hamming weights of affine Cartesian codes
- The \(\text{v} \)-number of monomial ideals
- Title not available (Why is that?)
Uses Software
This page was built for publication: Footprint and minimum distance functions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4582785)