Sparse differential resultant for Laurent differential polynomials
From MaRDI portal
Publication:2351806
DOI10.1007/s10208-015-9249-9zbMath1315.12003arXiv1111.1084OpenAlexW2251334620WikidataQ59435610 ScholiaQ59435610MaRDI QIDQ2351806
Wei Li, Chun-Ming Yuan, Xiao-Shan Gao
Publication date: 26 June 2015
Published in: Foundations of Computational Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1111.1084
sparse differential resultantsingle exponential algorithmJacobi numberPoisson product formulaBKK bounddifferential toric variety
Symbolic computation and algebraic computation (68W30) Toric varieties, Newton polyhedra, Okounkov bodies (14M25) Differential algebra (12H05) Computational aspects in algebraic geometry (14Q99)
Related Items
Toric difference variety, Differential elimination by differential specialization of Sylvester style matrices, Computation of differential Chow forms for ordinary prime differential ideals, Jacobi's bound: Jacobi's results translated in Kőnig's, Egerváry's and Ritt's mathematical languages, Partial differential Chow forms and a type of partial differential Chow varieties, Chow form for projective differential variety, Binomial difference ideals, Elimination theory in differential and difference algebra, New bounds and an efficient algorithm for sparse difference resultants, Tropical differential Gröbner bases
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Linear sparse differential resultant formulas
- Differential elimination with Dixon resultants
- Definability and fast quantifier elimination in algebraically closed fields
- Linear complete differential resultants and the implicitization of linear DPPEs
- Generalised characteristic polynomials
- Bounds for the degrees in the Nullstellensatz
- Generalized Euler integrals and \(A\)-hypergeometric functions
- Le formalisme du résultant. (The formalism of resultant)
- On the computational complexity and geometry of the first-order theory of the reals. I: Introduction. Preliminaries. The geometry of semi-algebraic sets. The decision problem for the existential theory of the reals
- Chow polytopes and general resultants
- The number of roots of a system of equations
- Automated reasoning in differential geometry and mechanics using the characteristic set method. I: An improved version of Ritt-Wu's decomposition algorithm
- On the Newton polytope of the resultant
- Product formulas for resultants and Chow forms
- A resultant theory for the systems of two ordinary algebraic differential equations
- Factorization-free decomposition algorithms in differential algebra
- Improved algorithms for computing determinants and resultants
- The computational complexity of the Chow form
- Efficient incremental algorithms for the sparse resultant and the mixed volume
- Chow form for projective differential variety
- The Schmidt-Kolchin conjecture
- A bound for orders in differential Nullstellensatz
- On the complexity of sparse elimination
- Macaulay style formulas for sparse resultants
- Matrix Formulae of Differential Resultant for First Order Generic Ordinary Differential Polynomials
- Intersection theory in differential algebraic geometry: Generic intersections and the differential Chow form
- Formale Theorie der linearen Differentialgleichungen. (Erster Teil).
- Order and Dimension
- Resultants and Chow forms via exterior syzygies
- A Poisson formula for the sparse resultant
- Sparse differential resultant
- Jacobi's Bound for the Order of Systems of First Order Differential Equations
- Ore subresultant coefficients in solutions
