Square-free powers of Cohen-Macaulay forests, cycles, and whiskered cycles
Abstract
Let denote the square-free power of the edge ideal of a graph . In this article, we provide a precise formula for the depth of when is a Cohen-Macaulay forest. Using this, we show that for a Cohen-Macaulay forest , the square-free power of is always Cohen-Macaulay, which is quite surprising since all ordinary powers of can never be Cohen-Macaulay unless is a disjoint union of edges. Next, we give an exact formula for the regularity and tight bounds on the depth of square-free powers of edge ideals of cycles. In the case of whiskered cycles, we obtain tight bounds on the regularity and depth of square-free powers, which aids in identifying when such ideals have linear resolutions. Additionally, we compute depth of when is a cycle or whiskered cycle, and regularity of when is a whiskered cycle.
Cite
@article{arxiv.2409.06021,
title = {Square-free powers of Cohen-Macaulay forests, cycles, and whiskered cycles},
author = {Kanoy Kumar Das and Amit Roy and Kamalesh Saha},
journal= {arXiv preprint arXiv:2409.06021},
year = {2024}
}
Comments
Conjecture 6.1 of the previous version is now Theorem 4.2 and the rest of the paper has been revised accordingly