Footprint and minimum distance functions
From MaRDI portal
Publication:4582785
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.
Recommendations
Cites work
- scientific article; zbMATH DE number 108068 (Why is no real title available?)
- scientific article; zbMATH DE number 3463763 (Why is no real title available?)
- Algebraic methods for parameterized codes and invariants of vanishing ideals over finite fields
- Characteristic-independence of Betti numbers of graph ideals
- Cohen-Macaulay graphs
- Computational methods of commutative algebra and algebraic geometry. With chapters by David Eisenbud, Daniel R. Grayson, Jürgen Herzog and Michael Stillman
- Covering the cube by affine hyperplanes
- Degree and algebraic properties of lattice and matrix ideals
- Distributive lattices, bipartite graphs and Alexander duality
- Evaluation codes from an affine variety code perspective
- Footprints or generalized Bezout's theorem
- Hilbert functions of graded algebras
- Introduction to liaison theory and deficiency modules
- Minimum distance functions of graded ideals and Reed-Muller-type codes
- On the second Hamming weight of some Reed-Muller type codes
- On the second weight of generalized Reed-Muller codes
- On the structure of order domains
- Reed-Muller-type codes over the Segre variety
- Regularity of lex-segment ideals: Some closed formulas and applications
- Regularity, depth and arithmetic rank of bipartite edge ideals
- The Geometry of Syzygies
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
- scientific article; zbMATH DE number 1830738 (Why is no real title available?)
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)