相关论文: Powers of Edge Ideals with Linear Quotients

We further develop the theory of $W\!$-graph ideals, first introduced by the authors in reference [6]. We discuss $W\!$-graph subideals, and induction and restriction of $W\!$-graph ideals for parabolic subgroups. We introduce $W\!$-graph…

For a finite simple graph $G$ we give an upper bound for the regularity of the powers of the edge ideal $I(G)$.

Consider an ideal $I\subset K[x_1,..., x_n]$, with $K$ an arbitrary field, generated by monomials of degree two. Assuming that $I$ does not have a linear resolution, we determine the step $s$ of the minimal graded free resolution of $I$…

We study the regularity of small symbolic powers and integral closure of small powers of edge ideals. We also prove that the regularity of integral closure of powers of edge ideals of graphs with at most two odd cycles is the same as the…

We classify all graphs $G$ satisfying the property that all matching powers $I(G)^{[k]}$ of the edge ideal $I(G)$ are bi-Cohen-Macaulay for $1\le k\le\nu(G)$, where $\nu(G)$ is the maximum size of a matching of $G$.

This paper gives some exact formulas for the depth of powers of the edge ideal of an edge-weighted integrally closed cycle.

For positive integers $n$ and $r$, we let $Q_n^r$ denote the $r$th power of the $n$-dimensional discrete hypercube graph, i.e., the graph with vertex-set $\{0,1\}^n$, where two 0-1 vectors are joined if they are Hamming distance at most $r$…

We study monomial cut ideals associated to a graph $G$, which are a monomial analogue of toric cut ideals as introduced by Sturmfels and Sullivant. Primary decompositions, projective dimensions, and Castelnuovo-Mumford regularities are…

The study of the edge ideal $I(D_{G})$ of a weighted oriented graph $D_{G}$ with underlying graph $G$ started in the context of Reed-Muller type codes. We generalize a Cohen-Macaulay construction for $I(D_{G})$, which Villarreal gave for…

We describe all connected graphs whose edge ideals are almost normally torsionfree. We also prove that the facet ideal of a special odd cycle is almost normally torsionfree. Finally, we determine the t-spread principal Borel ideals…

Let $G$ be a simple graph on $n$ vertices. Let $L_G \text{ and } \mathcal{I}_G \: $ denote the Lov\'asz-Saks-Schrijver(LSS) ideal and parity binomial edge ideal of $G$ in the polynomial ring $S = \mathbb{K}[x_1,\ldots, x_n, y_1, \ldots,…

In this paper we provide some exact formulas for the projective dimension and the regularity of edge ideals of vertex-weighted oriented unicyclic graphs. These formulas are in function of the weight of the vertices, the numbers of edges. We…

Herzog, Hibi, and Zheng classified the Cohen-Macaulay edge ideals of chordal graphs. In this paper, we classify Cohen-Macaulay edge ideals of (vertex) weighted oriented chordal and simplicial graphs, a more general class of monomial ideals.…

We study the closed neighborhood ideals and the dominating ideals of graphs, in particular, of trees and cycles. We prove that the closed neighborhood ideals and the dominating ideals of trees are normally torsion-free. The closed…

Inspired by the definition of $\bf{t}$-spread monomial ideals, in this paper, we introduce $\bf{t}$-spread $d$-partite hypergraph $K^{\bf t}_V$ and study its edge ideal $I(K^{\bf t}_V)$. We prove that $I(K^{\bf t}_V)$ has linear quotients,…

We give a new criterion which guarantees that a free group admits a bi-ordering that is invariant under a given automorphism. As an application, we show that the fundamental group of the "magic manifold" is bi-orderable, answering a…

Two-dimensional squarefree monomial ideals can be seen as the Stanley-Reisner ideals of graphs. The main results of this paper are combinatorial characterizations for the Cohen-Macaulayness of ordinary and symbolic powers of such an ideal…

We show that the graded maximal ideal of a graded $K$-algebra $R$ has linear quotients for a suitable choice and order of its generators if the defining ideal of $R$ has a quadratic Gr\"obner basis with respect to the reverse lexicographic…

For the almost complete intersection ideals $(x_1^2, \dots, x_n^2, (x_1 + \cdots + x_n)^k)$, we compute their reduced Gr\"obner basis for any term ordering, revealing a combinatorial structure linked to lattice paths, elementary symmetric…

We graph-theoretically characterize the class of graphs $G$ such that $I(G)^2$ are Buchsbaum.