pith. sign in

arxiv: 1003.4375 · v1 · pith:4HWBPEL5new · submitted 2010-03-23 · 🧮 math.CA

A perturbed differential resultant based implicitization algorithm for linear DPPEs

classification 🧮 math.CA
keywords differentiallinearnonzeropolynomialalgorithmdcresimplicitizationresultant
0
0 comments X
read the original abstract

Let $\bbK$ be an ordinary differential field with derivation $\partial$. Let $\cP$ be a system of $n$ linear differential polynomial parametric equations in $n-1$ differential parameters with implicit ideal $\id$. Given a nonzero linear differential polynomial $A$ in $\id$ we give necessary and sufficient conditions on $A$ for $\cP$ to be $n-1$ dimensional. We prove the existence of a linear perturbation $\cP_{\phi}$ of $\cP$ so that the linear complete differential resultant $\dcres_{\phi}$ associated to $\cP_{\phi}$ is nonzero. A nonzero linear differential polynomial in $\id$ is obtained from the lowest degree term of $\dcres_{\phi}$ and used to provide an implicitization algorithm for $\cP$.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.