Abstract
In this chapter we discuss free resolutions of monomial ideals; we call them monomial resolutions. The problem to describe the minimal free resolution of a monomial ideal (over a polynomial ring) was posed by Kaplansky in the early 1960’s. Despite the helpful combinatorial structure of monomial ideals, the problem turned out to be hard. The structure of a minimal free monomial resolution can be quite complex. There exists a minimal free monomial resolution which cannot be encoded in the structure of any CW-complex. In fact, even the minimal free resolutions of ideals generated by quadratic monomials are so complicated that it is beyond reach to obtain a description of them; we do not even know how to express the regularity of such ideals. In this situation, the guideline is to introduce new ideas and constructions which either have strong applications or/and are beautiful. Most proofs about monomial resolutions are easy. The key point is not to provide complicated proofs, but to introduce new beautiful ideas.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 2011 Springer-Verlag London Limited
About this chapter
Cite this chapter
Peeva, I. (2011). Monomial Resolutions. In: Graded Syzygies. Algebra and Applications, vol 14. Springer, London. https://doi.org/10.1007/978-0-85729-177-6_3
Download citation
DOI: https://doi.org/10.1007/978-0-85729-177-6_3
Publisher Name: Springer, London
Print ISBN: 978-0-85729-176-9
Online ISBN: 978-0-85729-177-6
eBook Packages: Mathematics and StatisticsMathematics and Statistics (R0)