The v\mathrm{v}-number of Monomial Ideals

preprint2022arXivOpen access

Abstract

We generalize some results of v\mathrm{v}-number for arbitrary monomial ideals by showing that the v\mathrm{v}-number of an arbitrary monomial ideal is the same as the v\mathrm{v}-number of its polarization. We prove that the v\mathrm{v}-number v(I(G))\mathrm{v}(I(G)) of the edge ideal I(G)I(G), the induced matching number im(G)\mathrm{im}(G) and the regularity reg(R/I(G))\mathrm{reg}(R/I(G)) of a graph GG, satisfy v(I(G))≤im(G)≤reg(R/I(G))\mathrm{v}(I(G))\leq \mathrm{im}(G)\leq \mathrm{reg}(R/I(G)), where GG is either a bipartite graph, or a (C4,C5)(C_{4},C_{5})-free vertex decomposable graph, or a whisker graph. There is an open problem in \cite{v}, whether v(I)≤reg(R/I)+1\mathrm{v}(I)\leq \mathrm{reg}(R/I)+1 for any square-free monomial ideal II. We show that v(I(G))>reg(R/I(G))+1\mathrm{v}(I(G))>\mathrm{reg}(R/I(G))+1, for a disconnected graph GG. We derive some inequalities of v\mathrm{v}-numbers which may be helpful to answer the above problem for the case of connected graphs. We connect v(I(G))\mathrm{v}(I(G)) with an invariant of the line graph L(G)L(G) of GG. For a simple connected graph GG, we show that reg(R/I(G))\mathrm{reg}(R/I(G)) can be arbitrarily larger than v(I(G))\mathrm{v}(I(G)). Also, we try to see how the v\mathrm{v}-number is related to the Cohen-Macaulay property of square-free monomial ideals.

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Reviews 0

Write a reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.