相关论文: Extremal Betti numbers of some Cohen-Macaulay bino…

Let $S = K[x_1,..., x_n]$ be a polynomial ring over a field $K$. Let $I(G) \subseteq S$ denote the edge ideal of a graph $G$. We show that the $\ell$th symbolic power $I(G)^{(\ell)}$ is a Cohen-Macaulay ideal (i.e., $S/I(G)^{(\ell)}$ is…

Let $\mathbf{CCM}$ denote the class of closed graphs with Cohen-Macaulay binomial edge ideals and $\mathbf{PIG}$ denote the class of proper interval graphs. Then $\mathbf{CCM}\subseteq \mathbf{PIG}$. The $\mathbf{PIG}$-completion problem is…

A very well-covered graph is an unmixed graph without isolated vertices such that the height of its edge ideal is half of the number of vertices. We study these graphs by means of Betti splittings and mapping cone constructions. We show…

We introduce binomial edge ideals attached to a simple graph $G$ and study their algebraic properties. We characterize those graphs for which the quadratic generators form a Gr\"obner basis in a lexicographic order induced by a vertex…

The notion of Frobenius Betti numbers generalizes the Hilbert-Kunz multiplicity theory and serves as an invariant that measures singularity. However, the explicit computation of the Frobenius Betti numbers of rings has been limited to very…

Let $I(G_{\mathbf{w}})$ be the edge ideal of an edge-weighted graph $(G,\mathbf{w})$. We prove that $I(G_{\mathbf{w}})$ is sequentially Cohen-Macaulay for all weight functions $w$ if and only if $G$ is a Woodroofe graph.

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…

We describe the Betti numbers of the edge ideals $I(G)$ of uniform hypergraphs $G$ such that $I(G)$ has linear graded free resolution. We give an algebraic equation system and some inequalities for the components of the $f$--vector of the…

In this paper, we study rooted products of graphs from the perspective of combinatorial commutative algebra. For edge ideals, we introduce the 2-Cohen-Macaulayness with respect to a vertex and use it to investigate when edge ideals of…

We find a class of block graphs whose binomial edge ideals have minimal regularity. As a consequence, we characterize the trees whose binomial edge ideals have minimal regularity. Also, we show that the binomial edge ideal of a block graph…

We give an explicit formula for the Hilbert-Poincar\'{e} series of the parity binomial edge ideal of a complete graph $K_{n}$ or equivalently for the ideal generated by all $2\times 2$-permanents of a $2\times n$-matrix. It follows that the…

We obtain an improved lower bound for the regularity of the binomial edge ideals of trees. We prove an upper bound for the regularity of the binomial edge ideals of certain subclass of block-graphs. As a consequence we obtain sharp upper…

We study algebraic and homological properties of facet ideals of order complexes of posets which we call ideals of maximal flags of posets or simply flag ideals. We characterize the unmixed and Cohen-Macaulay flag ideals of graded posets.…

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,…

A natural extension of bipartite graphs are $d$-partite clutters, where $d \geq 2$ is an integer. For a poset $P$, Ene, Herzog and Mohammadi introduced the $d$-partite clutter $\mathcal{C}_{P,d}$ of multichains of length $d$ in $P$, showing…

In this paper, we prove the upper bound conjecture proposed by Saeedi Madani \& Kiani on the Castelnuovo-Mumford regularity of generalized binomial edge ideals. We give a combinatorial upper bound of regularity for generalized binomial edge…

Let $J_G$ be the binomial edge ideal of a graph $G$. We characterize all graphs whose binomial edge ideals, as well as their initial ideals, have regularity $3$. Consequently we characterize all graphs $G$ such that $J_G$ is extremal…

Independent sets play a key role into the study of graphs and important problems arising in graph theory reduce to them. We define the monomial ideal of independent sets associated to a finite simple graph and describe its homological and…

In this paper, we use Betti splittings of binomial edge ideals to establish improved upper and lower bounds for their regularity in the case of trees. As a consequence, we determine the exact regularity for certain classes of trees.

We study homological properties of random quadratic monomial ideals in a polynomial ring $R = {\mathbb K}[x_1, \dots x_n]$, utilizing methods from the Erd\"{o}s-R\'{e}nyi model of random graphs. Here for a graph $G \sim G(n, p)$ we consider…