Searcharxiv⌕ Search

arXiv subjects

Susan Morey

Publications and source records attributed to Susan Morey.

28 records · Page 2Linked to original sources

Edge ideals of oriented graphs

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.

math.AC↗

A Lower Bound For Depths of Powers of Edge Ideals

Let $G$ be a graph and let $I$ be the edge ideal of $G$. Our main results in this article provide lower bounds for the depth of the first three powers of $I$ in terms of the diameter of $G$. More precisely, we show that $\depth R/I^t \geq \left\lceil{\frac{d-4t+5}{3}} \right\rceil +p-1$, where $d$ is the diameter of $G$, $p$ is the number of connected components of $G$ and $1 \leq t \leq 3$. For general powers of edge ideals we show

math.AC↗

Depths and Cohen-Macaulay Properties of Path Ideals

Given a tree T on n vertices, there is an associated ideal I of a polynomial ring in n variables over a field, generated by all paths of a fixed length of T. We show that such an ideal always satisfies the Konig property and classify all trees for which R/I is Cohen-Macaulay. More generally, we show that an ideal I whose generators correspond to any collection of subtrees of T satisfies the Konig property. Since the edge ideal of a simplicial tree has this form, this generalizes a result of Faridi. Moreover, every square-free monomial ideal can be represented (non-uniquely) as a subtree ideal of a graph, so this construction provides a new combinatorial tool for studying square-free monomial ideals. For a special class of trees, namely trees that are themselves a path, a precise formula for the depth is given and it is shown that the proof extends to provide a lower bound on the Stanley depth of these ideals. Combining these results gives a new class of ideals for which the Stanley Conjecture holds.

math.AC↗

Minimal Reductions and Cores of Edge Ideals

We study minimal reductions of edge ideals of graphs and determine restrictions on the coefficients of the generators of these minimal reductions. We prove that when $I$ is not basic, then $\core{I}\subset \m I$, where $I$ is an edge ideal in the corresponding localized polynomial ring and $\m$ is the maximal ideal of this ring. We show that the inclusion is an equality for the edge ideal of an even cycle with an arbitrary number of whiskers. Moreover, we show that the core is obtained as a finite intersection of homogeneous minimal reductions in the case of even cycles. The formula for the core does not hold in general for the edge ideal of any graph and we provide a counterexample. In particular, we show in this example that the core is not obtained as a finite intersection of general minimal reductions.

math.AC↗

Associated primes of powers of edge ideals

Let G be a graph and let I be its edge ideal. Our main result shows that the sets of associated primes of the powers of I form an ascending chain. It is known that the sets of associated primes of I(i) and intcl(I(i)) stabilize for large i, where "intcl" denotes integral closure and I(i) denotes the i-th power of I. We show that for edge ideals their corresponding stable sets are equal. To show our main result we use a classical result of Berge from matching theory and certain notions from combinatorial optimization.

math.AC↗

Edge ideals: algebraic and combinatorial properties

Let C be a clutter and let I(C) be its edge ideal. This is a survey paper on the algebraic and combinatorial properties of R/I(C) and C, respectively. We give a criterion to estimate the regularity of R/I(C) and apply this criterion to give new proofs of some formulas for the regularity. If C is a clutter and R/I(C) is sequentially Cohen-Macaulay, we present a formula for the regularity of the ideal of vertex covers of C and give a formula for the projective dimension of R/I(C). We also examine the associated primes of powers of edge ideals, and show that for a graph with a leaf, these sets form an ascending chain.

math.AC↗

Depths of Powers of the Edge Ideal of a Tree

Lower bounds are given for the depths of R/I^t for t at least one when I is the edge ideal of a tree or forest. The bounds are given in terms of the diameter of the tree, or in case of a forest, the largest diameter of a connected component and the number of connected components. These lower bounds provide a lower bound on the power for which the depths stabilize.

math.AC↗

Embedded Associated Primes of Powers of Square-free Monomial Ideals

An ideal I in a Noetherian ring R is normally torsion-free if Ass(R/I^t)=Ass(R/I) for all natural numbers t. We develop a technique to inductively study normally torsion-free square-free monomial ideals. In particular, we show that if a square-free monomial ideal I is minimally not normally torsion-free then the least power t such that I^t has embedded primes is bigger than beta_1, where beta_1 is the monomial grade of I, which is equal to the matching number of the hypergraph H(I) associated to I. If in addition I fails to have the packing property, then embedded primes of I^t do occur when t=beta_1 +1. As an application, we investigate how these results relate to a conjecture of Conforti and Cornuéjols.

math.AC↗

Cohen-Macaulay admissible clutters

There is a one-to-one correspondence between square-free monomial ideals and clutters, which are also known as simple hypergraphs. It was conjectured that unmixed admissible clutters are Cohen-Macaulay. We prove the conjecture for uniform admissible clutters of heights 2 and 3. For admissible clutters of greater heights, we give a family of examples to show that the conjecture may fail. When the height is 4, we give an additional condition under which unmixed admissible clutters are Cohen-Macaulay.

math.AC↗

Cohen-Macaulay, Shellable and unmixed clutters with a perfect matching of König type

Let $\mathcal{C}$ be a clutter with a perfect matching $e_1,...,e_g$ of König type and let $Δ_\mathcal{C}$ be the Stanley-Reisner complex of the edge ideal of $\mathcal{C}$. If all c-minors of $\mathcal{C}$ have a free vertex and $\mathcal{C}$ is unmixed, we show that $Δ_\mathcal{C}$ is pure shellable. We are able to describe, in combinatorial and algebraic terms, when $Δ_\mathcal{C}$ is pure. If $\mathcal{C}$ has no cycles of length 3 or 4, then it is shown that $Δ_\mathcal{C}$ is pure if and only if $Δ_\mathcal{C}$ is pure shellable (in this case $e_i$ has a free vertex for all $i$), and that $Δ_\mathcal{C}$ is pure if and only if for any two edges $f_1,f_2$ of $\mathcal{C}$ and for any $e_i$, one has that $f_1\cap e_i\subset f_2\cap e_i$ or $f_2\cap e_i\subset f_1\cap e_i$. It is also shown that this ordering condition implies that $Δ_\mathcal{C}$ is pure shellable, without any assumption on the cycles of $\mathcal{C}$. Then we prove that complete admissible uniform clutters and their Alexander duals are unmixed. In addition, the edge ideals of complete admissible uniform clutters are facet ideals of shellable simplicial complexes, they are Cohen-Macaulay, and they have linear resolutions. Furthermore if $ \mathcal{C}$ is admissible and complete, then $\mathcal{C}$ is unmixed. We characterize certain conditions that occur in a Cohen-Macaulay criterion for bipartite graphs of Herzog and Hibi, and extend some results of Faridi--on the structure of unmixed simplicial trees--to clutters with the König property without 3-cycles or 4-cycles.

math.AC↗