
Minimal resolutions of monomial ideals
Erika Ordog – Texas A&M University
The problem of finding minimal free resolutions of monomial ideals in polynomial rings has been central to commutative algebra ever since Kaplansky raised the problem in the 1960s and his student, Diana Taylor, produced the first general construction in 1966. The ultimate goal along these lines is a construction of free resolutions that is universal — that is, valid for arbitrary monomial ideals — canonical, combinatorial, and minimal. This talk describes a solution to the problem valid in characteristic 0 and almost all positive characteristics. The differential involves a sum over lattice paths of weights associated to higher-dimensional analogues of spanning trees in appropriate simplicial complexes.