Monomial Resolutions
| dc.creator | Bayer, Dave | |
| dc.creator | Peeva, Irena | |
| dc.creator | Sturmfels, Bernd | |
| dc.date | 1996-10-11 | |
| dc.date.accessioned | 2026-07-07T09:07:01Z | |
| dc.date.available | 2026-07-07T09:07:01Z | |
| dc.description | Call a monomial ideal M "generic" if no variable appears with the same nonzero exponent in two distinct monomial generators. Using a convex polytope first studied by Scarf, we obtain a minimal free resolution of M. Any monomial ideal M can be made generic by deformation of its generating exponents. Thus, the above construction yields a (usually nonminimal) resolution of M for arbitrary monomial ideals, bounding the Betti numbers of M in terms of the Upper Bound Theorem for Convex Polytopes. We show that our resolutions are DG-algebras, and consider realizability questions and irreducible decompositions. | |
| dc.description | plain TeX, 20 pages with 5 figures, Postscript file available from ftp://math.columbia.edu/pub/bayer/monomial_resolutions/monres.ps | |
| dc.identifier | https://arxiv.org/abs/alg-geom/9610012 | |
| dc.identifier | http://arxiv.org/abs/alg-geom/9610012 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/150220 | |
| dc.subject | Algebraic Geometry | |
| dc.title | Monomial Resolutions | |
| dc.type | text |