The Buchberger resolution
From MaRDI portal
Abstract: We define the Buchberger resolution, which is a graded free resolution of a monomial ideal in a polynomial ring. Its construction uses a generalization of the Buchberger graph and encodes much of the combinatorics of the Buchberger algorithm. The Buchberger resolution is a cellular resolution that coincides with the Scarf resolution for generic monomial ideals, which is the case when it is minimal. The simplicial complex underlying the Buchberger resolution is of interest for its own sake and its combinatorics is not fully understood. We close with a conjecture on the clique complex of the Buchberger graph.
Recommendations
Cited in
(8)- Gersten resolution with support
- The Anick resolution
- The Poset of Proper Divisibility
- Simplicial complexes in Macaulay2
- Barile-Macchia resolutions
- Minimal cellular resolutions of monomial ideals with five generators and their Artinian reductions
- Minimal resolutions of monomial ideals
- Betti numbers of monomial ideals via facet covers
This page was built for publication: The Buchberger resolution
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q502915)