Degree and algebraic properties of lattice and matrix ideals
From MaRDI portal
(Redirected from Publication:4979847)
Abstract: We study the degree of non-homogeneous lattice ideals over arbitrary fields, and give formulae to compute the degree in terms of the torsion of certain factor groups of Z^s and in terms of relative volumes of lattice polytopes. We also study primary decompositions of lattice ideals over an arbitrary field using the Eisenbud-Sturmfels theory of binomial ideals over algebraically closed fields. We then use these results to study certain families of integer matrices (PCB, GPCB, CB, GCB matrices) and the algebra of their corresponding matrix ideals. In particular, the family of generalized positive critical binomial matrices (GPCB matrices) is shown to be closed under transposition, and previous results for PCB ideals are extended to GPCB ideals. Then, more particularly, we give some applications to the theory of 1-dimensional binomial ideals. If G is a connected graph, we show as a further application that the order of its sandpile group is the degree of the Laplacian ideal and the degree of the toppling ideal. We also use our earlier results to give a structure theorem for graded lattice ideals of dimension 1 in 3 variables and for homogeneous lattices in Z^3 in terms of critical binomial ideals (CB ideals) and critical binomial matrices, respectively, thus complementing a well-known theorem of Herzog on the toric ideal of a monomial space curve.
Recommendations
Cited in
(28)- Divisor class groups of affine semigroup rings associated with distributive lattices
- Primary decomposition of lattice basis ideals
- Minimal free resolutions of lattice ideals of digraphs
- Mixed matrices and binomial ideals
- The vertex ideal of a lattice.
- Generalized minimum distance functions
- Codes over a weighted torus
- On the regularity of join-meet ideals of modular lattices
- Principal matrices of numerical semigroups
- A determinantal formula for circuits of integer lattices
- Projective toric varieties of codimension 2 with maximal Castelnuovo-Mumford regularity
- Evaluation codes and their basic parameters
- Generalized minimum distance functions and algebraic invariants of Geramita ideals
- Minimal generating sets of lattice ideals
- Arithmetical structures on graphs
- Computing the degree of a lattice ideal of dimension one
- Matrices defining Gorenstein lattice ideals
- Divisors on graphs, binomial and monomial ideals, and cellular resolutions
- Primer for the algebraic geometry of sandpiles
- Binomial vanishing ideals
- Minimum distance functions of graded ideals and Reed-Muller-type codes
- Some Arithmetic Properties of Matroidal Ideals
- Footprint and minimum distance functions
- Regularity and algebraic properties of certain lattice ideals
- Polar degrees and closest points in codimension two
- Rational points of lattice ideals on a toric variety and toric codes
- Sumsets and Veronese varieties
- Explicit deformation of lattice ideals via chip-firing games on directed graphs
This page was built for publication: Degree and algebraic properties of lattice and matrix ideals
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4979847)