Linear sparse differential resultant formulas
Sonia L. Rueda

TL;DR
This paper introduces determinant-based formulas for eliminating variables in linear differential systems, enabling computation of differential resultants, especially for sparse generic systems, with potential applications in symbolic computation.
Contribution
It presents new determinant formulas for differential elimination in linear systems and connects them to the differential resultant for sparse generic systems.
Findings
Formulas are determinants of coefficient matrices of derivatives.
The formula res(P) has no zero columns if P is 'super essential'.
Applicable to computing differential resultants for sparse systems.
Abstract
Let be a system of linear nonhomogeneous ordinary differential polynomials in a set of differential indeterminates. Differential resultant formulas are presented to eliminate the differential indeterminates in from . These formulas are determinants of coefficient matrices of appropriate sets of derivatives of the differential polynomials in , or in a linear perturbation of . In particular, the formula is the determinant of a matrix having no zero columns if the system is "super essential". As an application, if the system is sparse generic, such formulas can be used to compute the differential resultant introduced by Li, Gao and Yuan in (Proceedings of the ISSAC'2011).
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsPolynomial and algebraic computation · Numerical methods for differential equations · Advanced Differential Equations and Dynamical Systems
