A hypergraph characterization of nearly complete intersections
Commutative Algebra
2024-10-15 v2
Abstract
Recently, nearly complete intersection ideals were defined by Boocher and Seiner to establish lower bounds on Betti numbers for monomial ideals (arXiv:1706.09866). Stone and Miller then characterized nearly complete intersections using the theory of edge ideals (arXiv:2101.07901). We extend their work to fully characterize nearly complete intersections of arbitrary generating degrees and use this characterization to compute minimal free resolutions of nearly complete intersections from their degree 2 part.
Cite
@article{arxiv.2101.08401,
title = {A hypergraph characterization of nearly complete intersections},
author = {Chiara Bondi and Courtney R. Gibbons and Yuye Ke and Spencer Martin and Shrunal Pothagoni and Andrew Stelzer},
journal= {arXiv preprint arXiv:2101.08401},
year = {2024}
}
Comments
This work was initiated as part of the virtual COURAGE REU in Summer 2020, supported by Clemson University's School of Mathematical and Statistical Sciences. Corresponding Author: Courtney R. Gibbons (Hamilton College). 18 pages