Pith. sign in

REVIEW

A hypergraph characterization of nearly complete intersections

Not yet reviewed by Pith; the record is open.

Re-run · record.json Download PDF Read on arXiv ↗

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2101.08401 v2 pith:QXFESYIM submitted 2021-01-21 math.AC

A hypergraph characterization of nearly complete intersections

Chiara Bondi , Courtney R. Gibbons , Yuye Ke , Spencer Martin , Shrunal Pothagoni , Andrew Stelzer This is my paper
classification math.AC
keywords completenearlyintersectionsidealsarxivcharacterizationarbitrarybetti
verification ladder T0 review T1 audit T2 compute T3 formal T4 reserved
0 comments
read the original 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.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.