arXiv subjects
Publications and source records attributed to Kuei-Nuan Lin.
In this short note, we confirm a conjecture of Vasconcelos which states that the Rees algebra of any Artinian almost complete intersection monomial ideal is almost Cohen-Macaulay.
Let $\mathcal{D}$ be a weighted oriented graph and let $I(\mathcal{D})$ be its edge ideal in a polynomial ring $R$. We give the formula of Castelnuovo-Mumford regularity of $R/I(\mathcal{D})$ when $\mathcal{D}$ is a weighted oriented path or cycle such that edges of $\mathcal{D}$ are oriented in one direction. Additionally, we compute the projective dimension for this class of graphs.
Given a square-free monomial ideal $I$ in a polynomial ring $R$ over a field $\mathbb{K}$, one can associate it with its LCM-lattice and its hypergraph. In this short note, we establish the connection between the LCM-lattice and the hypergraph, and in doing so we provide a sufficient condition for removing higher dimension edges of the hypergraph without impacting the projective dimension of the square-free monomial ideal. We also offer algorithms to compute the projective dimension of a class of square-free monomial ideals built using the new result and previous results of Lin-Mantero.
This paper explores the relation between multi-Rees algebras and ideals that arise in the study of toric dynamical systems from the theory of chemical reaction networks.
We investigate the Rees algebra and the toric ring of the squarefree monomial ideal associated to the three-dimensional Ferrers diagram. Under the projection property condition, we describe explicitly the presentation ideals of the Rees algebra and the toric ring. We show that the toric ring is a Koszul Cohen--Macaulay normal domain, while the Rees algebra is Koszul and the defining ideal is of fiber type.
Let $\mathcal{D}$ be a weighted oriented graph and let $I(\mathcal{D})$ be its edge ideal. Under a natural condition that the underlying (undirected) graph of $\mathcal{D}$ contains a perfect matching consisting of leaves, we provide several equivalent conditions for the Cohen-Macaulayness of $I(\mathcal{D})$. We also completely characterize the Cohen-Macaulayness of $I(\mathcal{D})$ when the underlying graph of $\mathcal{D}$ is a bipartite graph. When $I(\mathcal{D})$ fails to be Cohen-Macaulay, we give an instance where $I(\mathcal{D})$ is shown to be sequentially Cohen-Macaulay.
Given a monomial ideal in a polynomial ring over a field, we define the LCM-dual of the given ideal. We show good properties of LCM-duals. Including the isomorphism between the special fiber of LCM-dual and the special fiber of given monomial ideal. We show the special fibers of LCM-duals of strongly stable ideals are normal Cohen-Macaulay Koszul domains. We provide an explicit describing of minimal free resolutions of LCM-duals of strongly stable ideals.
We prove a sufficient and a necessary condition for a square-free monomial ideal $J$ associated to a (dual) hypergraph to have projective dimension equal to the minimal number of generators of $J$ minus 2. We also provide an effective explicit procedure to compute the projective dimension of 1-dimensional hypergraphs $\mathcal{H}$ when each connected component contains at most one cycle. An algorithm to compute the projective dimension is also included. Applications of these results are given; they include, for instance, computing the projective dimension of monomial ideals whose associated hypergraph has a spanning Ferrers graph.
We provide the sufficient conditions for Rees algebras of modules to be Cohen-Macaulay, which has been proven in the case of Rees algebras of ideals by Johnson-Ulrich and Goto-Nakamura-Nishida. As it turns out the generalization from ideals to modules is not just a routine generalization, but requires a great deal of technical development. We use the technique of generic Bourbaki ideals introduced by Simis, Ulrich and Vasconcelos to obtain the Cohen-Macaulayness of Rees Algebras of modules.
We study the question of when 0-1 polytopes are normal or, equivalently, having the integer decomposition property. In particular, we shall associate to each 0-1 polytope a labeled hypergraph, and examine the equality between its Ehrhart and polytopal rings via the combinatorial structures of the labeled hypergraph.
We present a closed formula and a simple algorithmic procedure to compute the projective dimension of square-free monomial ideals associated to string or cycle hypergraphs. As an application, among these ideals we characterize all the Cohen-Macaulay ones.
In this paper we describe the defining equations of the Rees algebra and the special fiber ring of a truncation I of a complete intersection ideal in a polynomial ring over a field with homogeneous maximal ideal m. To describe explicitly the Rees algebra R(I) in terms of generators and relations we map another Rees ring R(M) onto it, where M is the direct sum of powers of m. We compute a Groebner basis of the ideal defining R(M). It turns out that the normal domain R(M) is a Koszul algebra and from this we deduce that in many instances R(I) is a Koszul algebra as well.
We define a new combinatorial object, which we call a labeled hypergraph, uniquely associated to any square-free monomial ideal. We prove several upper bounds on the regularity of a square-free monomial ideal in terms of simple combinatorial properties of its labeled hypergraph. We also give specific formulas for the regularity of square-free monomial ideals with certain labeled hypergraphs. Furthermore, we prove results in the case of one-dimensional labeled hypergraphs.
We study the defining equations of the Rees algebra of square-free monomial ideals in a polynomial ring over a field. We determine that when an ideal $I$ is generated by $n$ square-free monomials of the same degree then $I$ has relation type at most $n-2$ as long as $n \leq 5$. In general, we establish the defining equations of the Rees algebra in this case. Furthermore, we give a class of examples with relation type at least $n-2$, where $n=μ(I)$. We also provide new classes of ideals of linear type. We propose the construction of a graph, namely the generator graph of an ideal, where the monomial generators serve as vertices for the graph. We show that when $I$ is a square-free monomial ideal generated in the same degree that is at least 2 and the generator graph of $I$ is the graph of a disjoint union of trees and graphs with unique odd cycles then $I$ is an ideal of linear type.
There is a natural epimorphism from the symmetric algebra to the Rees algebra of an ideal. When this epimorphism is an isomorphism, we say that the ideal is of linear type. Given two determinantal rings over a field, we consider the diagonal ideal, the kernel of the multiplication map. We prove that the diagonal ideal is of linear type and recover the defining ideal of the Rees algebra in some special cases. The special fiber ring of the diagonal ideal is the homogeneous coordinate ring of the join variety.
Given two determinantal rings over a field k. We consider the Rees algebra of the diagonal ideal, the kernel of the multiplication map. The special fiber ring of the diagonal ideal is the homogeneous coordinate ring of the join variety. When the Rees algebra and the Symmetric algebra coincide, we show that the Rees algebra is Cohen-Macaulay.