We study minimal free resolutions of edge ideals of bipartite graphs. We associate a directed graph to a bipartite graph whose edge ideal is unmixed, and give expressions for the regularity and the depth of the edge ideal in terms of invariants of the directed graph. For some classes of unmixed edge ideals, we show that the arithmetic rank of the ideal equals projective dimension of its quotient.

A ΣΠΣΠ(k) circuit C = ∑k i=1 Fi = ∑k i=1 ∏di j=1 fij is unmixed if for each i ∈ [k], Fi = fi1(x1) · · · fin(xn), where each fij is a univariate polynomial given in the sparse representation. In this paper, we give a polynomial time black-box algorithm of identity testing for the low degree unmixed ΣΠΣΠ(k) circuits. In order to obtain the black-box algorithm, we first show that a special class o...

Let D be a weighted oriented graph, whose underlying graph is G , and let I (D) its edge ideal. If has no 3-, 5-, or 7-cycles, K?nig, we characterize when unmixed. 3- 5-cycles, Cohen–Macaulay. We prove that unmixed if only Cohen–Macaulay girth greater than 7 K?nig 4-cycles.

In this work, a new approach to background subtraction based on independent component analysis is presented. This approach assumes that background and foreground information are mixed in a given sequence of images. Then, foreground and background components are identified, if their probability density functions are separable from a mixed space. Afterwards, the components estimation process cons...

This paper was motivated by a problem left by Herzog and Hibi, namely to classify all unmixed polymatroidal ideals. In the particular case of polymatroidal ideals corresponding to discrete polymatroids of Veronese type, i.e ideals of Veronese type, we give a complete description of the associated prime ideals and then, we show that such an ideal is unmixed if and only if it is CohenMacaulay. We...