‎in this paper we give a characterization of unmixed tripartite‎ ‎graphs under certain conditions which is a generalization of a‎ ‎result of villarreal on bipartite graphs‎. ‎for bipartite graphs two‎ ‎different characterizations were given by ravindra and villarreal‎. ‎we show that these two characterizations imply each other‎.

‎let $i$ denote an ideal of a noetherian ring $r$‎. ‎the purpose of‎ ‎this article is to introduce the concepts of quintasymptotic‎ ‎sequences over $i$ and quintasymptotic cograde of $i$‎, ‎and to show that they play a role analogous to quintessential sequences‎ ‎over $i$ and quintessential cograde of $i$‎. ‎we show that‎, ‎if $r$ is‎ ‎local‎, ‎then the quintasymptotic cograde of $i$ is una...

A solution X of a discrete-time algebraic Riccati equation is called unmixed if the corresponding closed-loop matrix Φ(X) has the property that the common roots of det (sI−Φ(X)) and det (I− sΦ(X)∗) (if any) are on the unit circle. A necessary and sufficient condition is given for existence and uniqueness of an unmixed solution such that the eigenvalues of Φ(X) lie in a prescribed subset of C. A...

The ideal binary mask is often seen as a goal for time-frequency masking algorithms trying to increase speech intelligibility, but the required availability of the unmixed signals makes it difficult to calculate the ideal binary mask in any real-life applications. In this paper we derive the theory and the requirements to enable calculations of the ideal binary mask using a directional system w...

Constructive methods for matrices of multihomogeneous (or multigraded) resultants for unmixed systems have been studied by Weyman, Zelevinsky, Sturmfels, Dickenstein and Emiris. We generalize these constructions to mixed systems, whose Newton polytopes are scaled copies of one polytope, thus taking a step towards systems with arbitrary supports. First, we specify matrices whose determinant equa...

Structural conditions on the support of a multivariate polynomial system are developed for which the Dixon-based resultant methods compute exact resultants. For cases when this cannot be done, an upper bound on the degree of the extraneous factor in the projection operator can be determined a priori, thus resulting in quick identification of the extraneous factor in the projection operator. (Fo...

Let C be a clutter with a perfect matching e1, . . . , eg of König type and let ∆C be the Stanley-Reisner complex of the edge ideal of C. If all c-minors of C have a free vertex and C is unmixed, we show that ∆C is pure shellable. We are able to describe in combinatorial terms when ∆C is pure. If C has no cycles of length 3 or 4, then it is shown that ∆C is pure if and only if ∆C is pure shella...