Barile-Macchia resolutions

Selvi Kara; Trung Chau

REVIEW

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 2211.04640 v2 pith:CJTARURZ submitted 2022-11-09 math.AC math.CO

Barile-Macchia resolutions

Trung Chau , Selvi Kara This is my paper

classification math.AC math.CO

keywords resolutionsbarile-macchiacellularidealsmatchingsminimalaboveacyclic

verification ladder T0 review T1 audit T2 compute T3 formal T4 reserved

0 comments

read the original abstract

We construct cellular resolutions for monomial ideals via discrete Morse theory. In particular, we develop an algorithm to create homogeneous acyclic matchings and we call the cellular resolutions induced from these matchings Barile-Macchia resolutions. These resolutions are minimal for edge ideals of weighted oriented forests and (most) cycles. As a result, we provide recursive formulas for graded Betti numbers and projective dimension. Furthermore, we compare Barile-Macchia resolutions to those created by Batzies and Welker and some well-known simplicial resolutions. Under certain assumptions, whenever the above resolutions are minimal, so are Barile-Macchia resolutions.

Barile-Macchia resolutions

discussion (0)