Regularity and Free Resolution of Ideals which are Minimal to $d$-linearity
Marcel Morales, Ali Akbar Yazdan Pour, Rashid Zaare-Nahandi

TL;DR
This paper investigates the properties of certain monomial ideals related to $d$-uniform clutters, focusing on their regularity, free resolutions, and conditions for linearity, with applications to graph theory and combinatorial topology.
Contribution
It introduces classes of $d$-uniform clutters with specific resolution properties and provides explicit minimal free resolutions for circuit ideals of complex topological structures.
Findings
Regularity of union of clutters equals maximum of individual regularities under certain conditions.
Explicit minimal free resolutions for circuit ideals of triangulations of pseudo-manifolds.
Alternative proofs for Fr"oberg's Theorem and properties of generalized chordal hypergraphs.
Abstract
Toward a partial classification of monomial ideals with -linear resolution, in this paper, some classes of -uniform clutters which do not have linear resolution, but every proper subclutter of them has a -linear resolution, are introduced and the regularity and Betti numbers of circuit ideals of such clutters are computed. Also, it is proved that for given two -uniform clutters , the Castelnuovo-Mumford regularity of the ideal is equal to the maximum of regularities of and , whenever is a clique or . As applications, alternative proofs are given for Fr\"oberg's Theorem on linearity of edge ideal of graphs with chordal complement as well as for linearity of…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsCommutative Algebra and Its Applications · Polynomial and algebraic computation · Advanced Optimization Algorithms Research
