Sparse differential resultant

Authors:
Wei Li;Xiao-Shan Gao;Cum-Ming Yuan
Affiliations:
KLMM, Institute of Systems Science, AMSS, Chinese Academy of Sciences, Beijing, China;KLMM, Institute of Systems Science, AMSS, Chinese Academy of Sciences, Beijing, China;KLMM, Institute of Systems Science, AMSS, Chinese Academy of Sciences, Beijing, China
Venue:
Proceedings of the 36th international symposium on Symbolic and algebraic computation
Year:
2011

Citing 10
Cited 1

Generalised characteristic polynomials

Journal of Symbolic Computation - Special issue on computational algebraic complexity
On the Newton Polytope of the Resultant

Journal of Algebraic Combinatorics: An International Journal
Efficient incremental algorithms for the sparse resultant and the mixed volume

Journal of Symbolic Computation
A new algorithm for the geometric decomposition of a variety

ISSAC '99 Proceedings of the 1999 international symposium on Symbolic and algebraic computation
An Efficient Algorithm for the Sparse Mixed Resultant

AAECC-10 Proceedings of the 10th International Symposium on Applied Algebra, Algebraic Algorithms and Error-Correcting Codes
Gröbner-Bases, Gaussian elimination and resolution of systems of algebraic equations

EUROCAL '83 Proceedings of the European Computer Algebra Conference on Computer Algebra
Improved algorithms for computing determinants and resultants

Journal of Complexity - Special issue: Foundations of computational mathematics 2002 workshops
Algebraic transformation of differential characteristic decompositions from one ranking to another

Journal of Symbolic Computation
Computing differential characteristic sets by change of ordering

Journal of Symbolic Computation
Linear complete differential resultants and the implicitization of linear DPPEs

Journal of Symbolic Computation

Sparse difference resultant

Proceedings of the 38th international symposium on International symposium on symbolic and algebraic computation

Quantified Score

Hi-index	0.01

Visualization

Abstract

In this paper, the concept of sparse differential resultant for a differentially essential system of differential polynomials is introduced and its properties are proved. In particular, a degree bound for the sparse differential resultant is given. Based on the degree bound, an algorithm to compute the sparse differential resultant is proposed, which is single exponential in terms of the order, the number of variables, and the size of the differentially essential system.