On the Castelnuovo–Mumford regularity of symbolic powers of cover ideals

Assume that [Formula: see text] is a graph with cover ideal [Formula: see text]. For every integer [Formula: see text], we denote the [Formula: see text]th symbolic power of [Formula: see text] by [Formula: see text]. We provide a sharp upper bound for the regularity of [Formula: see text] in terms of the star packing number of [Formula: see text]. Also, for any integer [Formula: see text], we study the difference between [Formula: see text] and [Formula: see text]. As a consequence, we compute the regularity of [Formula: see text] when [Formula: see text] is a doubly Cohen–Macaulay graph. Furthermore, we determine [Formula: see text] if [Formula: see text] is either a Cameron–Walker graph or a claw-free graph which has no cycle of length other than [Formula: see text] and [Formula: see text].

Authors

Institutions

Publication Details

Journal
Journal of Algebra and Its Applications
Published
2025-12-20
DOI
https://doi.org/10.1142/s0219498827501209
Primary Topic
Commutative Algebra and Its Applications
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

On the Castelnuovo–Mumford regularity of symbolic powers of cover ideals

S. A. Seyed Fakhari
Journal of Algebra and Its Applications
Commutative Algebra and Its Applications
article

On the Castelnuovo–Mumford regularity of symbolic powers of cover ideals

S. A. Seyed Fakhari
article en

Abstract

Assume that [Formula: see text] is a graph with cover ideal [Formula: see text]. For every integer [Formula: see text], we denote the [Formula: see text]th symbolic power of [Formula: see text] by [Formula: see text]. We provide a sharp upper bound for the regularity of [Formula: see text] in terms of the star packing number of [Formula: see text]. Also, for any integer [Formula: see text], we study the difference between [Formula: see text] and [Formula: see text]. As a consequence, we compute the regularity of [Formula: see text] when [Formula: see text] is a doubly Cohen–Macaulay graph. Furthermore, we determine [Formula: see text] if [Formula: see text] is either a Cameron–Walker graph or a claw-free graph which has no cycle of length other than [Formula: see text] and [Formula: see text].

Journal of Algebra and Its Applications
Universidad de Los Andes (CO)
Openalex Percentile: Top 53%
Commutative Algebra and Its Applications
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.