The short resolution of a lattice ideal

The short resolution of a lattice ideal is a free resolution over a polynomial ring whose number of variables is the number of extremal rays in the associated cone. A combinatorial description of this resolution is given. In the homogeneous case, the regularity can be computed from this resolution.

Saved in:
Bibliographic Details
Published in:Proceedings of the American Mathematical Society 2003-04, Vol.131 (4), p.1081-1091
Main Author: Casares, Pilar Pisón
Format: Article
Language:English
Subjects:
Algebra
Algebraic geometry
Algorithmics. Computability. Computer arithmetics
Applied sciences
Binomials
Commutative rings and algebras
Computer science
control theory
systems
Coordinate systems
Exact sciences and technology
Linear algebra
Mathematical lattices
Mathematical rings
Mathematics
Morphisms
Polynomials
Remainders
Research article
Sciences and techniques of general use
Semigroups
Theoretical computing
Citations: Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:The short resolution of a lattice ideal is a free resolution over a polynomial ring whose number of variables is the number of extremal rays in the associated cone. A combinatorial description of this resolution is given. In the homogeneous case, the regularity can be computed from this resolution.
ISSN:0002-9939
1088-6826
DOI:10.1090/S0002-9939-02-06767-9