On the Castelnuovo-Mumford regularity of symbolic powers of cover ideals
S. A. Seyed Fakhari

TL;DR
This paper establishes sharp bounds and exact formulas for the Castelnuovo-Mumford regularity of symbolic powers of cover ideals in graphs, linking algebraic invariants to graph combinatorics.
Contribution
It provides new bounds and exact regularity computations for symbolic powers of cover ideals based on graph properties, including star packing and specific graph classes.
Findings
Sharp upper bounds for regularity in terms of star packing number
Exact regularity for doubly Cohen-Macaulay graphs
Regularity formulas for Cameron-Walker and certain claw-free graphs
Abstract
Assume that is a graph with cover ideal . For every integer , we denote the -th symbolic power of by . We provide a sharp upper bound for the regularity of in terms of the star packing number of . Also, for any integer , we study the difference between and . As a consequence, we compute the regularity of when is a doubly Cohen-Macaulay graph. Furthermore, we determine if is either a Cameron-Walker graph or a claw-free graph which has no cycle of length other that and .
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 · Cholinesterase and Neurodegenerative Diseases · Graph theory and applications
