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.
Connections
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 review
No reviews yet.
Discussion 0
Add a comment
No comments yet.