Single-lifting Macaulay-type formulae of generalized unmixed sparse resultants
نویسندگان
چکیده
منابع مشابه
Single-lifting Macaulay-type formulae of generalized unmixed sparse resultants
Resultants are defined in the sparse (or toric) context in order to exploit the structure of the polynomials as expressed by their Newton polytopes. Since determinantal formulae are not always possible, the most efficient general method for computing resultants is as the ratio of two determinants. This is made possible by Macaulay’s seminal result [15] in the dense homogeneous case, extended by...
متن کاملMacaulay Style Formulas for Sparse Resultants
We present formulas for computing the resultant of sparse polynomials as a quotient of two determinants, the denominator being a minor of the numerator. These formulas extend the original formulation given by Macaulay for homogeneous polynomials.
متن کاملCohen-macaulay, Shellable and Unmixed Clutters with a Perfect Matching of König Type
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...
متن کاملResultants for Unmixed Bivariate Polynomial Systems using the Dixon formulation
A necessary and sufficient condition on the support of a generic unmixed bivariate polynomial system is identified such that for polynomial systems with such support, the Dixon resultant formulation produces their resultants. It is shown that Sylvester-type matrices can also be obtained for such polynomial systems. These results are shown to be a generalization of related results recently repor...
متن کاملGeneralized Lifting for Sparse Image Representation and Coding
This paper investigates the use of generalized lifting to increase the sparseness of wavelet decompositions with application to image representation and coding. As in the bandelet approach, the strategy consists in applying first a separable wavelet decomposition and then in processing the details subbands to further decorrelate the signal representation. For this second step, we use a generali...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Symbolic Computation
سال: 2011
ISSN: 0747-7171
DOI: 10.1016/j.jsc.2011.02.002