Elimination theory in differential and difference algebra (Q1730314): Difference between revisions

By ``elimination theory'', the authors mean the transformation of a system of equations into another system with the same solutions, but such that the new system is of a form that makes it easier to identify the solutions than in the original system. Moreover, the transformation process should be systematic, even algorithmic. Guassian elimination for systems of linear equations is the archetype. The systems of equations the authors are concerned with are differential polynomial equations and their generalizations: initially involving a single derivation, then finitely many commuting derivations (partial differential equations), a single automorphism (difference equations), and mixed differential -- difference equations. The methods reviewed include the characteristic set method, Chow forms, resultants, and sparse resultants. The paper provides the necessary definitions and then states the relevant theorems, providing references to the literature for proofs. When such exist, the authors also provide information about algorithmic versions of the methods. With a bibliography of 98 items, the authors have provided a fairly complete guide to what is currently known about elimination theory in the context of differential and difference equations.