Minimal resolutions of lattice ideals
Abstract
A canonical minimal free resolution of an arbitrary co-artinian lattice ideal over the polynomial ring is constructed over any field whose characteristic is 0 or any but finitely many positive primes. The differential has a closed-form combinatorial description as a sum over lattice paths in of weights that come from sequences of faces in simplicial complexes indexed by lattice points. Over a field of any characteristic, a non-canonical but simpler resolution is constructed by selecting choices of higher-dimensional analogues of spanning trees along lattice paths. These constructions generalize sylvan resolutions for monomial ideals by lifting them equivariantly to lattice modules.
Keywords
Cite
@article{arxiv.2208.09557,
title = {Minimal resolutions of lattice ideals},
author = {Yupeng Li and Ezra Miller and Erika Ordog},
journal= {arXiv preprint arXiv:2208.09557},
year = {2024}
}
Comments
v2: 13 pages, 6 figures; new section 5 as an extended example to the construction. v1: 9 pages, no figures