AbstractThe main question of this paper is: What happens to sparse resultants under composition? More precisely, let f1,⋯, fnbe homogeneous sparse polynomials in the variables y1,⋯, ynand g1,⋯, gnbe homogeneous sparse polynomials in the variables x1,⋯, xn. Let fi ∘ (g1,⋯, gn) be the sparse homogeneous polynomial obtained from fiby replacing yj by gj. Naturally a question arises: Is the sparse resultant of f1 ∘ (g1,⋯, gn), ⋯, fn ∘ (g1,⋯, gn)in any way related to the (sparse) resultants of f1,⋯, fnand g1,⋯, gn? The main contribution of this paper is to provide an answer for the case when g1,⋯, gnare unmixed, namely, ResC1,⋯, Cn(f1 ∘ (g1,⋯, gn),⋯, fn ∘ (g1,⋯, gn)) = Resd1,⋯, dn(f1,⋯, fn)Vol(Q)ResB(g1,⋯, gn)d1⋯dn, where Resd1,..., dnstands for ...
Resultants characterize the existence of roots of systems of multivariate nonlinear polynomial equat...
A matrix representation of the sparse differential resultant is the basis for efficient computation ...
A matrix representation of the sparse differential resultant is the basis for efficient computation ...
AbstractThe main question of this paper is: What happens to sparse resultants under composition? Mor...
AbstractThis paper is the second in a series of papers on sparse resultants of composed polynomials....
AbstractThis paper is the second in a series of papers on sparse resultants of composed polynomials....
AbstractThe main question of this paper is: What is the dense (Macaulay) resultant of composed polyn...
The main question of this paper is: What is the dense (Macaulay) resultant of composed polynomials? ...
AbstractThe main question of this paper is: What is the dense (Macaulay) resultant of composed polyn...
We present formulas for computing the resultant of sparse polyno- mials as a quotient of two determi...
We present formulas for computing the resultant of sparse polyno- mials as a quotient of two determi...
We present a product formula for the initial parts of the sparse resultant associated with an arbitr...
The resultant matrix of a polynomial system depends on the geometry of its input Newton polytopes. T...
Abstract. We present an upper bound for the height of the mixed sparse resultant, defined as the log...
New results relating the sparsity of nonhomogeneous polynomial systems and computation of their proj...
Resultants characterize the existence of roots of systems of multivariate nonlinear polynomial equat...
A matrix representation of the sparse differential resultant is the basis for efficient computation ...
A matrix representation of the sparse differential resultant is the basis for efficient computation ...
AbstractThe main question of this paper is: What happens to sparse resultants under composition? Mor...
AbstractThis paper is the second in a series of papers on sparse resultants of composed polynomials....
AbstractThis paper is the second in a series of papers on sparse resultants of composed polynomials....
AbstractThe main question of this paper is: What is the dense (Macaulay) resultant of composed polyn...
The main question of this paper is: What is the dense (Macaulay) resultant of composed polynomials? ...
AbstractThe main question of this paper is: What is the dense (Macaulay) resultant of composed polyn...
We present formulas for computing the resultant of sparse polyno- mials as a quotient of two determi...
We present formulas for computing the resultant of sparse polyno- mials as a quotient of two determi...
We present a product formula for the initial parts of the sparse resultant associated with an arbitr...
The resultant matrix of a polynomial system depends on the geometry of its input Newton polytopes. T...
Abstract. We present an upper bound for the height of the mixed sparse resultant, defined as the log...
New results relating the sparsity of nonhomogeneous polynomial systems and computation of their proj...
Resultants characterize the existence of roots of systems of multivariate nonlinear polynomial equat...
A matrix representation of the sparse differential resultant is the basis for efficient computation ...
A matrix representation of the sparse differential resultant is the basis for efficient computation ...