相关论文: Regularity and Free Resolution of Ideals which are…

In this paper, we study Cstelnuovo-Mumford regularity of square-free monomial ideals generated in degree 3. We define some operations on the clutters associated to such ideals and prove that the regularity is conserved under these…

We construct the first linear strand of the minimal free resolutions of edge ideals of $d$-partite $d$-uniform clutters. We show that the first linear strand is supported on a relative simplicial complex. In the case that the edge ideals of…

Castelnuovo-Mumford regularity is a measure of algebraic complexity of an ideal. Regularity of monomial ideals can be investigated combinatorially. We use a simple graph decomposition and results from structural graph theory to prove,…

For a given clutter $\mathcal{C}$, let $I:=I ( \bar{\mathcal{C}} )$ be the circuit ideal in the polynomial ring $S$. In this paper, we show that the Betti numbers of $I$ and $I + ( \textbf{x}_F )$ are the same in their non-linear strands,…

This paper concerns the study of a class of clutters called simplicial subclutters. Given a clutter $\mathcal{C}$ and its simplicial subclutter $\mathcal{D}$, we compare some algebraic properties and invariants of the ideals $I, J$…

For a finite simple graph $G$ and an integer $r \ge 1$, the $r$-connected ideal $I_r(G)$ is the squarefree monomial ideal generated by the vertex sets of connected induced subgraphs of size $r+1$, extending the classical edge ideal. We…

In a 2008 paper, the first author and Van Tuyl proved that the regularity of the edge ideal of a graph G is at most one greater than the matching number of G. In this note, we provide a generalization of this result to any square-free…

We show that the ideal of an arrangement of d linear subspaces of projective space is d-regular in the sense of Castelnuovo and Mumford, answering a question of B. Sturmfels. In particular this implies that the ideal of an arrangement of d…

In this paper we study the Castelnuovo-Mumford regularity of the path ideals of finite simple graphs. We find new upper bounds for various path ideals of gap free graphs. In particular we prove that the path ideals of gap free and claw…

Chordal clutters in the sense of [14] and [3] are defined via simplicial orders. Their circuit ideal has a linear resolution, independent of the characteristic of the base field. We show that any Betti sequence of an ideal with linear…

We survey a number of recent studies of the Castelnuovo-Mumford regularity of squarefree monomial ideals. Our focus is on bounds and exact values for the regularity in terms of combinatorial data from associated simplicial complexes and/or…

Let (P,<) be a finite poset and let G be its comparability graph. If cl(G) is the clutter of maximal cliques of G, we prove that cl(G) satisfies the max-flow min-cut property and that its edge ideal is normally torsion free. We prove that…

We study the topology of the lcm-lattice of edge ideals and derive upper bounds on the Castelnuovo-Mumford regularity of the ideals. In this context it is natural to restrict to the family of graphs with no induced 4-cycle in their…

Let $I$ and $J$ be edge ideals in a polynomial ring $R = \mathbb{K}[x_1,\ldots,x_n]$ with $I \subseteq J$. In this paper, we obtain a general upper and lower bound for the Castelnuovo-Mumford regularity of $IJ$ in terms of certain…

We introduce a squarefree monomial ideal associated to the set of domino tilings of a $2\times n$ rectangle and proceed to study the associated minimal free resolution. In this paper, we use results of Dalili and Kummini to show that the…

For all integers $4 \leq r \leq d$, we show that there exists a finite simple graph $G= G_{r,d}$ with toric ideal $I_G \subset R$ such that $R/I_G$ has (Castelnuovo-Mumford) regularity $r$ and $h$-polynomial of degree $d$. To achieve this…

We study monomial ideals with linear presentation or partially linear resolution. We give combinatorial characterizations of linear presentation for square-free ideals of degree 3, and for primary ideals whose resolutions are linear except…

In this article, we give a new upper bound for the regularity of edge ideals of gap-free graphs, in terms of the their minimal triangulation. Let $H_U=G\cup F_U$ be a minimal triangulation of a gap-free graph $G$, for some maximal…

In this short note we introduce a notion of extremality for Betti numbers of a minimal free resolution, which can be seen as a refinement of the notion of Mumford-Castelnuovo regularity. We show that extremal Betti numbers of an arbitrary…

We compute the Castelnuovo-Mumford regularity of the edge ideals of two families of circulant graphs, which includes all cubic circulant graphs. A feature of our approach is to combine bounds on the regularity, the projective dimension, and…