Searcharxiv⌕ Search

arXiv subjects

Rafael H. Villarreal

Publications and source records attributed to Rafael H. Villarreal.

72 records · Page 4Linked to original sources

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↗

Combinatorics of symbolic Rees algebras of edge ideals of clutters

Let C be a clutter and let I be its edge ideal. We present a combinatorial description of the minimal generators of the symbolic Rees algebra Rs(I) of I. It is shown that the minimal generators of Rs(I) are in one to one correspondence with the irreducible parallelizations of C. From our description some major results on symbolic Rees algebras of perfect graphs and clutters will follow. As a byproduct, we give a method, using Hilbert bases, to compute all irreducible parallelizations of C along with all the corresponding vertex covering numbers.

math.AC↗

Systems with the integer rounding property in normal monomial subrings

Let C be a clutter and let A be its incidence matrix. If the linear system x>=0;xA<=1 has the integer rounding property, we give a description of the canonical module and the a-invariant of certain normal subrings associated to C. If the clutter is a connected graph, we describe when the aforementioned linear system has the integer rounding property in combinatorial and algebraic terms using graph theory and the theory of Rees algebras. As a consequence we show that the extended Rees algebra of the edge ideal of a bipartite graph is Gorenstein if and only if the graph is unmixed.

math.AC↗

Ehrhart clutters: Regularity and Max-Flow Min-Cut

If C is a clutter with n vertices and q edges whose clutter matrix has column vectors V={v1,...,vq}, we call C an Ehrhart clutter if {(v1,1),...,(vq,1)} is a Hilbert basis. Letting A(P) be the Ehrhart ring of P=conv(V), we are able to show that if A is the clutter matrix of a uniform, unmixed MFMC clutter C, then C is an Ehrhart clutter and in this case we provide sharp bounds on the Castelnuovo-Mumford regularity of A(P). Motivated by the Conforti-Cornuejols conjecture on packing problems, we conjecture that if C is both ideal and the clique clutter of a perfect graph, then C has the MFMC property. We prove this conjecture for Meyniel graphs, by showing that the clique clutters of Meyniel graphs are Ehrhart clutters. In much the same spirit, we provide a simple proof of our conjecture when C is a uniform clique clutter of a perfect graph. We close with a generalization of Ehrhart clutters as it relates to total dual integrality.

math.AC↗

Algebraic and combinatorial properties of ideals and algebras of uniform clutters of TDI systems

Let C be a uniform clutter, i.e., all the edges of C have the same size, and let A be the incidence matrix of C. We denote the column vectors of A by v1,...,vq. The vertex covering number of C, denoted by g, is the smallest number of vertices in any minimal vertex cover of C. Under certain conditions we prove that C is vertex critical. If C satisfies the max-flow min-cut property, we prove that A diagonalizes over the integers to an identity matrix and that v1,...,vq is a Hilbert basis. It is shown that if C has a perfect matching such that C has the packing property and g=2, then A diagonalizes over the integers to an identity matrix. If A is a balanced matrix we prove that any regular triangulation of the cone generated by v1,...,vq is unimodular. Some examples are presented to show that our results only hold for uniform clutters. These results are closely related to certain algebraic properties, such as the normality or torsion freeness, of blowup algebras of edge ideals and to finitely generated abelian groups. They are also related to the theory of Gröbner bases of toric ideals and to Ehrhart rings.

math.AC↗

Ring graphs and complete intersection toric ideals

We study the family of graphs whose number of primitive cycles equals its cycle rank. It is shown that this family is precisely the family of ring graphs. Then we study the complete intersection property of toric ideals of bipartite graphs and oriented graphs. An interesting application is that complete intersection toric ideals of bipartite graphs correspond to ring graphs and that these ideals are minimally generated by Groebner bases. We prove that any graph can be oriented such that its toric ideal is a complete intersection with a universal Groebner basis determined by the cycles. It turns out that bipartite ring graphs are exactly the bipartite graphs that have complete intersection toric ideals for any orientation.

math.AC↗

Symbolic Rees algebras, vertex covers and irreducible representations of Rees cones

Let G be a simple graph and let J be its ideal of vertex covers. We give a graph theoretical description of the irreducible b-vertex covers of G, i.e., we describe the minimal generators of the symbolic Rees algebra of J. Then we study the irreducible b-vertex covers of the blocker of G, i.e., we study the minimal generators of the symbolic Rees algebra of the edge ideal of G. We give a graph theoretical description of the irreducible binary b-vertex covers of the blocker of G. It is shown that they correspond to irreducible induced subgraphs of G. As a byproduct we obtain a method, using Hilbert bases, to obtain all irreducible induced subgraphs of G. In particular we obtain all odd holes and antiholes. We study irreducible graphs and give a method to construct irreducible b-vertex covers of the blocker of G with high degree relative to the number of vertices of G.

math.AC↗

Duality, a-invariants and canonical modules of rings arising from linear optimization problems

The aim of this paper is to study integer rounding properties of various systems of linear inequalities to gain insight about the algebraic properties of Rees algebras of monomial ideals and monomial subrings. We study the normality and Gorenstein property--as well as the canonical module and the a-invariant--of Rees algebras and subrings arising from systems with the integer rounding property. We relate the algebraic properties of Rees algebras and monomial subrings with integer rounding properties and present a duality theorem.

math.AC↗

Cohen-Macaulay clutters with combinatorial optimization properties and parallelizations of normal edge ideals

Let C be a uniform clutter and let I=I(C) be its edge ideal. We prove that if C satisfies the packing property (resp. max-flow min-cut property), then there is a uniform Cohen-Macaulay clutter C1 satisfying the packing property (resp. max-flow min-cut property) such that C is a minor of C1. For arbitrary edge ideals of clutters we prove that the normality property is closed under parallelizations. Then we show some applications to edge ideals and clutters which are related to a conjecture of Conforti and Cornuéjols and to max-flow min-cut problems.

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↗

Shellable graphs and sequentially Cohen-Macaulay bipartite graphs

Associated to a simple undirected graph G is a simplicial complex whose faces correspond to the independent sets of G. We call a graph G shellable if this simplicial complex is a shellable simplicial complex in the non-pure sense of Bjorner-Wachs. We are then interested in determining what families of graphs have the property that G is shellable. We show that all chordal graphs are shellable. Furthermore, we classify all the shellable bipartite graphs; they are precisely the sequentially Cohen-Macaulay bipartite graphs. We also give an recursive procedure to verify if a bipartite graph is shellable. Because shellable implies that the associated Stanley-Reisner ring is sequentially Cohen-Macaulay, our results complement and extend recent work on the problem of determining when the edge ideal of a graph is (sequentially) Cohen-Macaulay. We also give a new proof for a result of Faridi on the sequentially Cohen-Macaulayness of simplicial forests.

math.CO↗

Normalization of monomial ideals and Hilbert functions

We study the normalization of a monomial ideal, and show how to compute its Hilbert function (using Ehrhart polynomials) if the ideal is zero dimensional. A positive lower bound for the second coefficient of the Hilbert polynomial is shown.

math.AC↗

Linear syzygies and birational combinatorics

Let $F$ be a finite set of monomials of the same degree $d\geq 2$ in a polynomial ring $R=k[x_1,...,x_n]$ over an arbitrary field $k$. We give some necessary and/or sufficient conditions for the birationality of the ring extension $k[F]\subset R^{(d)}$, where $R^{(d)}$ is the $d${\it th} Veronese subring of $R$. One of our results extends to arbitrary characteristic, in the case of rational monomial maps, a previous syzygy-theoretic birationality criterion in characteristic zero

math.AC↗

Explicit representations by halfspaces of the edge cone of a graph

Let G be an arbitrary simple graph. The main results are explicit representations of the edge cone of G as a finite intersection of closed halfspaces. If G is bipartite and connected we determine the facets of the edge cone and present a canonical irreducible representation.

math.CO↗

On the Betti numbers of some Gorenstein ideals

Assume $R$ is a polynomial ring over a field and $I$ is a homogeneous Gorenstein ideal of codimension $g\ge3$ and initial degree $p\ge2$. We prove that the number of minimal generators $ν(I_p)$ of $I$ that are in degree $p$ is bounded above by $ν_0={p+g-1\choose g-1}-{p+g-3\choose g-1}$, which is the number of minimal generators of the defining ideal of the extremal Gorenstein algebra of codimension $g$ and initial degree $p$. Further, $I$ is itself extremal if $ν(I_p)=ν_0$.

math.AC↗