Subadditivity, strand connectivity and multigraded Betti numbers of monomial ideals
A. V. Jayanthan, Arvind Kumar

TL;DR
This paper investigates subadditivity, strand connectivity, and multigraded Betti numbers of monomial ideals, providing new conditions and classes of graphs where these properties hold, advancing understanding in algebraic combinatorics.
Contribution
It establishes sufficient conditions for subadditivity, confirms it for complete intersection ideals, and explores strand connectivity and Betti number bounds for edge ideals.
Findings
Subadditivity holds for ideals generated by homogeneous complete intersections.
Identifies classes of graphs with subadditive edge ideals.
Provides upper bounds for multigraded Betti numbers of edge ideals.
Abstract
Let and be a homogeneous ideal. In this article, we first obtain certain sufficient conditions for the subadditivity of . As a consequence, we prove that if is generated by homogeneous complete intersection, then subadditivity holds for . We then study a conjecture of Avramov, Conca and Iyengar on subadditivity, when is a monomial ideal with Koszul. We identify several classes of edge ideals of graphs such that the subadditivity holds for . We then study the strand connectivity of edge ideals and obtain several classes of graphs whose edge ideals are strand connected. Finally, we compute upper bounds for multigraded Betti numbers of several classes of edge ideals.
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.
