ﻻ يوجد ملخص باللغة العربية
We introduce 2-partitionable clutters as the simplest case of the class of $k$-partitionable clutters and study some of their combinatorial properties. In particular, we study properties of the rank of the incidence matrix of these clutters and properties of their minors. A well known conjecture of Conforti and Cornuejols cite{ConfortiCornuejols,cornu-book} states: That all the clutters with the packing property have the max-flow min-cut property, i.e. are mengerian. Among the general classes of clutters known to verify the conjecture are: balanced clutters (Fulkerson, Hoffman and Oppenheim cite{FulkersonHoffmanOppenheim}), binary clutters (Seymour cite{Seymour}) and dyadic clutters (Cornuejols, Guenin and Margot cite{CornuejolsGueninMargot}). We find a new infinite family of 2-partitionable clutters, that verifies the conjecture. On the other hand we are interested in studying the normality of the Rees algebra associated to a clutter and possible relations with the Conforti and Cornuejols conjecture. In fact this conjecture is equivalent to an algebraic statement about the normality of the Rees algebra cite{rocky}.
We give upper bounds for the Stanley depth of edge ideals of certain k-partite clutters. In particular, we generalize a result of Ishaq about the Stanley depth of the edge ideal of a complete bipartite graph. A result of Pournaki, Seyed Fakhari and Y
The Cayley-Bacharach property, which has been classically stated as a property of a finite set of points in an affine or projective space, is extended to arbitrary 0-dimensional affine algebras over arbitrary base fields. We present characterizations
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
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-cu
We study absolutely Koszul algebras, Koszul algebras with the Backelin-Roos property and their behavior under standard algebraic operations. In particular, we identify some Veronese subrings of polynomial rings that have the Backelin-Roos property an