Search

In the present paper, we aim to classify monomial ideals whose all matching powers are Cohen-Macaulay. We especially focus our attention on edge ideals. The Cohen-Macaulayness of the last matching power of an edge ideal is characterized, providing an algebraic analogue of the famous Tutte theorem regarding graphs having a perfect matching. For chordal graphs, very well-covered graphs and Cameron-Walker graphs, we completely solve our problem.

For an ideal $I$ in a Noetherian ring $R$, we introduce and study its conductor as a tool to explore the Rees algebra of $I$. The conductor of $I$ is an ideal $C(I)\subset R$ obtained from the defining ideals of the Rees algebra and the symmetric algebra of $I$ by a colon operation. Using this concept we investigate when adding an element to an ideal preserves the property of being of linear type. In this regard, a generalization of a result by Valla in terms of the conductor ideal is presented. When the conductor of a graded ideal in a polynomial ring is the graded maximal ideal, a criteria is given for when the Rees algebra and the symmetric algebra have the same Krull dimension. Finally, noting the fact that the conductor of a monomial ideal is a monomial ideal, the conductor of some families of monomial ideals, namely bounded Veronese ideals and edge ideals of graphs, are determined., Comment: 16 pages, 1 figure

For an ideal $I$ in a Noetherian ring $R$, the Fitting ideals $\textrm{Fitt}_j(I)$ are studied. We discuss the question of when $\textrm{Fitt}_j(I)=I$ or $\sqrt{\textrm{Fitt}_j(I)}=\sqrt{I}$ for some $j$. A classical case is the Hilbert-Burch theorem when $j=1$ and $I$ is a perfect ideal of grade $2$ in a local ring.

Let $S=K[x_1,\ldots,x_n]$ be the polynomial ring over a field $K$, and let $A$ be a finitely generated standard graded $S$-algebra. We show that if the defining ideal of $A$ has a quadratic initial ideal, then all the graded components of $A$ are componentwise linear. Applying this result to the Rees ring $\mathcal{R}(I)$ of a graded ideal $I$ gives a criterion on $I$ to have componentwise linear powers. Moreover, for any given graph $G$, a construction on $G$ is presented which produces graphs whose cover ideals $I_G$ have componentwise linear powers. This in particular implies that for any Cohen-Macaulay Cameron-Walker graph $G$ all powers of $I_G$ have linear resolutions. Moreover, forming a cone on special graphs like unmixed chordal graphs, path graphs and Cohen-Macaulay bipartite graphs produces cover ideals with componentwise linear powers.

Let $S$ be the polynomial ring over a field $K$ in a finite set of variables, and let $ \mathfrak{m}$ be the graded maximal ideal of $S$. It is known that for a finitely generated graded $S$-module $M$ and all integers $k\gg 0$, the module $ \mathfrak{m}^kM$ is componentwise linear. For large $k$ we describe the pattern of the Betti table of $ \mathfrak{m}^kM$ when $\mathrm{char}(K)=0$ and $M$ is a submodule of a finitely generated graded free $S$-module. Moreover, we show that for any $k\gg 0$, $ \mathfrak{m}^kI$ has linear quotients if $I$ is a monomial ideal.

In this paper we introduce toric rings of multicomplexes. We show how to compute the divisor class group and the class of the canonical module when the toric ring is normal. In the special case that the multicomplex is a discrete polymatroid, its toric ring is studied deeply for several classes of polymatroids.

We consider standard graded toric rings $R_{\Delta}$ whose generators correspond to the faces of a simplicial complex $\Delta$. When $R_{\Delta}$ is normal, it is shown that its divisor class group is free. For a flag complex $\Delta$ which is the clique complex of a perfect graph, a nice description for the class group and the canonical module of $R_{\Delta}$ in terms of the minimal vertex covers of the graph is given. Moreover, for a quasi-forest simplicial complex a quadratic Gr\"obner basis for the defining ideal of $R_{\Delta}$ is presented. Using this fact we give combinatorial descriptions for the $a$-invariant and the Gorenstein property of $R_\Delta$., Comment: 15 pages

We extend the sortability concept to monomial ideals which are not necessarily generated in one degree and as an application we obtain normal Cohen-Macaulay toric rings attached to vertex cover ideals of graphs. Moreover, we consider a construction on a graph called a clique multi-whiskering which always produces vertex cover ideals with componentwise linear powers.

We consider the ideal of inner $2$-minors $I_{\mathcal{P}}$ of a finite set of cells $\mathcal{P}$, which we call the cell ideal of $\mathcal{P}$. A nice interpretation for the height of an unmixed ideal $I_{\mathcal{P}}$, in terms of the number of cells of $\mathcal{P}$ is given. Moreover, the coordinate rings of cell ideals with isolated singularities are determined.

We study ideals of Borel type, including $k$-Borel ideals and $t$-spread Veronese ideals. We determine their free resolutions and their homological shift ideals. The multiplicity and the analytic spread of equigenerated squarefree principal Borel ideals are computed. For the multiplicity, the result is given under an additional assumption which is always satisfied for squarefree principal Borel ideals. These results are used to analyze the behaviour of height, multiplicity and analytic spread of the homological shift ideals $HS_j(I)$ as functions of $j$, when $I$ is an equigenerated squarefree Borel ideal.

Let $R$ be a Cohen--Macaulay local $K$-algebra or a standard graded $K$-algebra over a field $K$ with a canonical module $\omega_R$. The trace of $\omega_R$ is the ideal $tr(\omega_R)$ of $R$ which is the sum of those ideals $\varphi(\omega_R)$ with $\varphi\in Hom_R(\omega_R,R)$. The smallest number $s$ for which there exist $\varphi_1, \ldots, \varphi_s \in Hom_R(\omega_R,R)$ with $tr(\omega_R)=\varphi_1(\omega_R) + \cdots + \varphi_s(\omega_R)$ is called the Teter number of $R$. We say that $R$ is of Teter type if $s = 1$. It is shown that $R$ is not of Teter type if $R$ is generically Gorenstein. In the present paper, we focus especially on $0$-dimensional graded and monomial $K$-algebras and present various classes of such algebras which are of Teter type.

Inspired by the notion of K\"onig graphs we introduce graded ideals of K\"onig type with respect to a monomial order $<$. It is shown that if $I$ is of K\"onig type, then the Cohen--Macaulay property of $\ini_<(I)$ does not depend on the characteristic of the base field. This happens to be the case also for $I$ itself when $I$ is a binomial edge ideal. Attached to an ideal of K\"onig type is a sequence of linear forms, whose elements are variables or differences of variables. This sequence is a system of parameters for $\ini_<(I)$, and is a potential system of parameters for $I$ itself. We study in detail the ideals of K\"onig type among the edge ideals, binomial edge ideals and the toric ideal of a Hibi ring and use the K\"onig property to determine explicitly their canonical module.

Let $S=K[x_1,\ldots,x_n]$ be the polynomial ring over a field and $A$ a standard graded $S$-algebra. In terms of the Gr\"obner basis of the defining ideal $J$ of $A$ we give a condition, called the x-condition, which implies that all graded components $A_k$ of $A$ have linear quotients and with additional assumptions are componentwise linear. A typical example of such an algebra is the Rees ring $R(I)$ of a graded ideal or the symmetric algebra $Sym(M)$ of a module $M$. We apply our criterion to study certain symmetric algebras and the powers of vertex cover ideals of certain classes of graphs.

We recall a numerical criteria for Cohen--Macaulayness related to system of parameters, and introduce monomial ideals of K\"onig type which include the edge ideals of K\"onig graphs. We show that a monomial ideal is of K\"onig type if and only if its corresponding residue class ring admits a system of parameters whose elements are of the form $x_i-x_j$. This provides an algebraic characterization of K\"onig graphs. We use this special parameter systems for the study of the edge ideal of K\"onig graphs and the study of the order complex of a certain family of posets. Finally, for any simplicial complex $\Delta$ we introduce a system of parameters for $K[\Delta]$ with a universal construction principle, independent of the base field and only dependent on the faces of $\Delta$. This system of parameters is an efficient tool to test Cohen--Macaulayness of the Stanley--Reisner ring of a simplicial complex.

We introduce a family of squarefree monomial ideals associated to finite simple graphs, whose monomial generators correspond to closed neighborhood of vertices of the underlying graph. Any such ideal is called the closed neighborhood ideal of the graph. We study some algebraic invariants of these ideals like Castelnuovo-Mumford regularity and projective dimension and present some combinatorial descriptions for these invariants in terms of graph invariants.

For a monomial ideal $I$, we consider the $i$th homological shift ideal of $I$, denoted by $\text{HS}_i(I)$, that is, the ideal generated by the $i$th multigraded shifts of $I$. Some algebraic properties of this ideal are studied. It is shown that for any monomial ideal $I$ and any monomial prime ideal $P$, $\text{HS}_i(I(P))\subseteq \text{HS}_i(I)(P)$ for all $i$, where $I(P)$ is the monomial localization of $I$. In particular, we consider the homological shift ideal of some families of monomial ideals with linear quotients. For any $\textbf{c}$-bounded principal Borel ideal $I$ and for the edge ideal of complement of any path graph, it is proved that $\text{HS}_i(I)$ has linear quotients for all $i$. As an example of $\textbf{c}$-bounded principal Borel ideals, Veronese type ideals are considered and it is shown that the homological shift ideal of these ideals are polymatroidal. This implies that for any polymatroidal ideal which satisfies the strong exchange property, $\text{HS}_j(I)$ is again a polymatroidal ideal for all $j$. Moreover, for any edge ideal with linear resolution, the ideal $\text{HS}_j(I)$ is characterized and it is shown that $\text{HS}_1(I)$ has linear quotients.

The present work is concerned with characterizing some algebraic invariants of edge ideals of hypergraphs. To this aim, firstly, we introduce some kinds of combinatorial invariants similar to matching numbers for hypergraphs. Then we compare them to each other and to previously existing ones. These invariants are used for characterizing or bounding some algebraic invariants of edge ideals of hypergraphs such as graded Betti numbers, projective dimension and Castelnouvo-Mumford regularity., Comment: To appear in Communications in Algebra

We introduce the notion of sortability and $t$-sortability for a simplicial complex and study the graphs for which their independence complexes are either sortable or $t$-sortable. We show that the proper interval graphs are precisely the graphs whose independence complex is sortable. By using this characterization, we show that the ideal generated by all squarefree monomials corresponding to independent sets of vertices of $G$ of size $t$ (for a given positive integer $t$) has the strong persistence property, when $G$ is a proper interval graph. Moreover, all of its powers have linear quotients.

The reduction number of monomial ideals in the polynomial $K[x,y]$ is studied. We focus on ideals $I$ for which $J=(x^a,y^b)$ is a reduction ideal. The computation of the reduction number amounts to solve linear inequalities. In some special cases the reduction number can be explicitly computed.

We introduce and study the concept which we call the splitting of a graph and compare algebraic properties of the edge ideals of graphs and those of their splitting graphs., Comment: to appear in Journal of Commutative Algebra

For a graph $G=(V,E)$, we call a subset $ S\subseteq V \cup E$ a total mixed dominating set of $G$ if each element of $V \cup E$ is either adjacent or incident to an element of $S$, and the total mixed domination number $\gamma_{tm}(G)$ of $G$ is the minimum cardinality of a total mixed dominating set of $G$. In this paper, we initiate to study the total mixed domination number of a connected graph by giving some tight bounds in terms of some parameters such as order and total domination numbers of the graph and its line graph. Then we discuss on the relation between total mixed domination number of a graph and its diameter. Studing of this number in trees is our next work. Also we show that the total mixed domination number of a graph is equale to the total domination number of a graph which is obtained by the graph. Giving the total mixed domination numbers of some special graphs is our last work.

In this paper we introduce a family of monomial ideals with the persistence property. Given positive integers $n$ and $t$, we consider the monomial ideal $I=Ind_t(P_n)$ generated by all monomials $\textbf{x} ^F$, where $F$ is an independent set of vertices of the path graph $P_n$ of size $t$, which is indeed the facet ideal of the $t$-th skeleton of the independence complex of $P_n$. We describe the set of associated primes of all powers of $I$ explicitly. It turns out that any such ideal $I$ has the persistence property. Moreover the index of stability of $I$ and the stable set of associated prime ideals of $I$ are determined., Comment: 11 pages

In this paper, we introduce and study families of squarefree monomial ideals called clique ideals and independence ideals that can be associated to a finite graph. A family of clique ideals with linear resolutions has been characterized. Moreover some families of graphs for which the quotient ring of their clique ideal is Cohen-Macaulay are introduced and some homological invariants of the clique ideal of a graph $G$ which is the complement of a path graph or a cycle graph, are obtained. Also some algebraic properties of the independence ideal of path graphs, cycle graphs and chordal graphs are studied., Comment: to appear in "Communications in Algebra"

For a simplicial complex $\Delta$, the affect of the expansion functor on combinatorial properties of $\Delta$ and algebraic properties of its Stanley-Reisner ring has been studied in some previous papers. In this paper, we consider the facet ideal $I(\Delta)$ and its Alexander dual which we denote by $J_{\Delta}$ to see how the expansion functor alter the algebraic properties of these ideals. It is shown that for any expansion $\Delta^{\alpha}$ the ideals $J_{\Delta}$ and $J_{\Delta^{\alpha}}$ have the same total Betti numbers and their Cohen-Macaulayness are equivalent, which implies that the regularities of the ideals $I(\Delta)$ and $I(\Delta^{\alpha})$ are equal. Moreover, the projective dimensions of $I(\Delta)$ and $I(\Delta^{\alpha})$ are compared. In the sequel for a graph $G$, some properties that are equivalent in $G$ and its expansions are presented and for a Cohen-Macaulay (resp. sequentially Cohen-Macaulay and shellable) graph $G$, we give some conditions for adding or removing a vertex from $G$, so that the remaining graph is still Cohen-Macaulay (resp. sequentially Cohen-Macaulay and shellable)., Comment: To appear in: Bull. Iranian Math. Soc. arXiv admin note: substantial text overlap with arXiv:1511.04676

In this paper, we introduce and generalize some combinatorial invariants of graphs such as matching number and induced matching number to hypergraphs. Then we compare them together and present some upper bounds for the regularity of Stanley-Reisner ring of $\Delta_{\mathcal{H}}$ for certain hypergraphs $\mathcal{H}$ in terms of the introduced matching numbers., Comment: arXiv admin note: substantial text overlap with arXiv:1305.5954

For a simplicial complex $\Delta$, we introduce a simplicial complex attached to $\Delta$, called the expansion of $\Delta$, which is a natural generalization of the notion of expansion in graph theory. We are interested in knowing how the properties of a simplicial complex and its Stanley-Reisner ring relate to those of its expansions. It is shown that taking expansion preserves vertex decomposable and shellable properties and in some cases Cohen-Macaulayness. Also it is proved that some homological invariants of Stanley-Reisner ring of a simplicial complex relate to those invariants in the Stanley-Reisner ring of its expansions.

Let $\Delta$ be a simplicial complex. We study the expansions of $\Delta$ mainly to see how the algebraic and combinatorial properties of $\Delta$ and its expansions are related to each other. It is shown that $\Delta$ is Cohen-Macaulay, sequentially Cohen-Macaulay, Buchsbaum or $k$-decomposable, if and only if an arbitrary expansion of $\Delta$ has the same property. Moreover, some homological invariants like the regularity and the projective dimension of the Stanley-Reisner ideals of $\Delta$ and those of their expansions are compared., Comment: 11 pages

We study the regularity and the projective dimension of the Stanley-Reisner ring of a $k$-decomposable simplicial complex and explain these invariants with a recursive formula. To this aim, the graded Betti numbers of $k$-decomposable monomial ideals which is the dual concept for $k$-decomposable simplicial complexes are studied and an inductive formula for the Betti numbers is given. As a corollary, for a chordal clutter $\mathcal{H}$, an upper bound for $reg(I(\mathcal{H}))$ is given in terms of the regularities of edge ideals of some chordal clutters which are minors of $\mathcal{H}$., Comment: 8 pages

In this paper, we explain the regularity, projective dimension and depth of edge ideal of some classes of graphs in terms of invariants of graphs. We show that for a $C_5$-free vertex decomposable graph $G$, $\T{reg}(R/I(G))= c_G$, where $c_G$ is the maximum number of 3-disjoint edges in $G$. Moreover for this class of graphs we characterize $\T{pd}(R/I(G))$ and $\T{depth}(R/I(G))$. As a corollary we describe these invariants in forests and sequentially Cohen-Macaulay bipartite graphs., Comment: To appear in: Proc. Amer. Math. Soc

In this paper firstly, we generalize the concept of codismantlable graphs to hypergraphs and show that some special vertex decomposable hypergraphs are codismantlable. Then we generalize the concept of bouquet in graphs to hypergraphs to extend some combinatorial invariants of graphs about disjointness of a set of bouquets. We use these invariants to characterize the projective dimension of Stanley-Reisner ring of special hypergraphs in some sense., Comment: To appear in Proceedings Mathematical Sciences

In this paper we study the Alexander dual of a vertex decomposable simplicial complex. We define the concept of a vertex splittable ideal and show that a simplicial complex $\Delta$ is vertex decomposable if and only if $I_{\Delta^{\vee}}$ is a vertex splittable ideal. Moreover, the properties of vertex splittable ideals are studied. As the main result, it is proved that any vertex splittable ideal has a Betti splitting and the graded Betti numbers of such ideals are explained with a recursive formula. As a corollary, recursive formulas for the regularity and projective dimension of $R/I_{\Delta}$, when $\Delta$ is a vertex decomposable simplicial complex, are given. Moreover, for a vertex decomposable graph $G$, a recursive formula for the graded Betti numbers of its vertex cover ideal is presented. In special cases, this formula is explained, when $G$ is chordal or a sequentially Cohen-Macaulay bipartite graph. Finally, among the other things, it is shown that an edge ideal of a graph is vertex splittable if and only if it has linear resolution., Comment: To appear in Math. Scand

In this paper we give upper bounds for the regularity of edge ideal of some classes of graphs in terms of invariants of graph. We introduce two numbers $a'(G)$ and $n(G)$ depending on graph $G$ and show that for a vertex decomposable graph $G$, $\reg(R/I(G))\leq \min\{a'(G),n(G)\}$ and for a shellable graph $G$, $\reg(R/I(G))\leq n(G)$. Moreover it is shown that for a graph $G$, where $G^c$ is a $d$-tree, we have $\pd(R/I(G))=\max_{v\in V(G)} \{\deg_G(v)\}$., Comment: 11 pages

For an unmixed bipartite graph $G$ we consider the lattice of vertex covers $\mathcal{L}_G$ and compute depth, projective dimension and extremal Betti-numbers of $R/I(G)$ in terms of this lattice., Comment: 8 pages, 1 figure

A hypergraph $H=(V,E)$, where $V=\{x_1,...,x_n\}$ and $E\subseteq 2^V$ defines a hypergraph algebra $R_H=k[x_1,...,x_n]/(x_{i_1}... x_{i_k}; \{i_1,...,i_k\}\in E)$. All our hypergraphs are $d$-uniform, i.e., $|e_i|=d$ for all $e_i\in E$. We determine the Poincar\'e series $P_{R_H}(t)=\sum_{i=1}^\infty\dim_k{\rm Tor}_i^{R_H}(k,k)t^i$ for some hypergraphs generalizing lines, cycles, and stars. We finish by calculating the graded Betti numbers and the Poincar\'e series of the graph algebra of the wheel graph., Comment: Six pages

We consider Stanley--Reisner rings $k[x_1,...,x_n]/I(\mc{H})$ where $I(\mc{H})$ is the edge ideal associated to some particular classes of hypergraphs. For instance, we consider hypergraphs that are natural generalizations of graphs that are lines and cycles, and for these we compute the Betti numbers. We also generalize upon some known results about chordal graphs and study a weak form of shellability.