OpenAlex ·

Comparisons between ordinary and symbolic powers of edge ideals with respect to regularity and depth

Yuji Muta

Published
Source
OpenAlex
Published in
arXiv (Cornell University)
DOI
10.48550/arxiv.2609.05945
Original
Read it at the publisher
Topics
Computational ComplexityNumber Theory

Abstract

In this paper, we investigate the difference between ordinary and symbolic powers of edge ideals on the Castelnuovo-Mumford regularity and the depth. As a main theorem, we prove that the regularities of ordinary and symbolic powers coincide for edge ideals of simplicial graphs, as a partial result of Minh's conjecture. For the depth, we first show that, for each $k\geq2$, the inequality $\operatorname{depth} S/I^{(k)}\geq\operatorname{depth} S/I^{k}$ does not hold for squarefree monomial ideals in general. On the other hand, we prove that it holds for edge ideals when $k=2,3$. We also study the symbolic-ordinary discrepancy module $I(G)^{(k)}/I(G)^{k}$ of the edge ideal $I(G)$ of a graph $G$ and give a graph-theoretic formula for its Krull dimension in terms of induced odd cycles of $G$, thereby answering a question and a problem posed by Ha and Minh.

The authors’ abstract, as arXiv lists it. arXiv’s listings, abstracts included, are free for anyone to reuse.

Read it on ReadSearch

Each opens after you create an account, and brings you back to this paper.

Already a reader? Sign in

All new papers in Computational Complexity

Get the few papers worth your time in Computational Complexity every morning.

ReadSearch reads the new papers in your field each day and brings you the few worth reading, each with its key finding in a sentence.

Papers belong to their authors and publishers; every page here links to the original. All research topics