Effective bounds for the consistency of differential equations

Richard Gustavson, Omar Leon Sanchez

    Research output: Contribution to journalArticlepeer-review

    92 Downloads (Pure)

    Abstract

    One method to determine whether or not a system of partial differential equations is consistent is to attempt to construct a solution using merely the “algebraic data” associated to the system. In technical terms, this translates to the problem of determining the existence of regular realizations of differential kernels via their possible prolongations. In this paper we effectively compute an
    improved upper bound for the number of prolongations needed to guarantee the existence of such realizations, which ultimately produces solutions to many types of systems of partial differential equations. This bound has several applications, including an improved upper bound for the order of characteristic sets of prime differential ideals. We obtain our upper bound by proving a new
    result on the growth of the Hilbert-Samuel function, which may be of independent interest.
    Original languageEnglish
    JournalJournal of Symbolic Computation
    Early online date22 Nov 2017
    DOIs
    Publication statusPublished - 2017

    Keywords

    • algebraic differential equations
    • antichain sequences
    • Hilbert-Samuel function 2010 MSC

    Fingerprint

    Dive into the research topics of 'Effective bounds for the consistency of differential equations'. Together they form a unique fingerprint.

    Cite this