The $\mathrm{v}$-number of Monomial Ideals
Abstract
We generalize some results of -number for arbitrary monomial ideals by showing that the -number of an arbitrary monomial ideal is the same as the -number of its polarization. We prove that the -number of the edge ideal , the induced matching number and the regularity of a graph , satisfy , where is either a bipartite graph, or a -free vertex decomposable graph, or a whisker graph. There is an open problem in \cite{v}, whether for any square-free monomial ideal . We show that , for a disconnected graph . We derive some inequalities of -numbers which may be helpful to answer the above problem for the case of connected graphs. We connect with an invariant of the line graph of . For a simple connected graph , we show that can be arbitrarily larger than . Also, we try to see how the -number is related to the Cohen-Macaulay property of square-free monomial ideals.
Cite
@article{arxiv.2111.12881,
title = {The $\mathrm{v}$-number of Monomial Ideals},
author = {Kamalesh Saha and Indranath Sengupta},
journal= {arXiv preprint arXiv:2111.12881},
year = {2022}
}
Comments
By adding Lemma 3.2, we have modified Proposition 3.2 (in v1) to Proposition 3.3 (in v2). Also, Theorem 3.3, Proposition 3.4, Proposition 3.5 have been modified to Theorem 3.4, Proposition 3.7, Proposition 3.9, respectively. We have added Lemma 3.8 to modify the proof of Proposition 3.9 (v2). Also, Corollary 3.5 and Example 3.6 have been added