Estimates for the coefficients of differential dimension polynomials

Abstract

We answer the following long-standing question of Kolchin: given a system of algebraic-differential equations (x1,…,xn)=0 in m derivatives over a differential field of characteristic zero, is there a computable bound, that only depends on the order of the system (and on the fixed data m and n), for the typical differential dimension of any prime component of ? We give a positive answer in a strong form; that is, we compute a (lower and upper) bound for all the coefficients of the Kolchin polynomial of every such prime component. We then show that, if we look at those components of a specified differential type, we can compute a significantly better bound for the typical differential dimension. This latter improvement comes from new combinatorial results on characteristic sets, in combination with the classical theorems of Macaulay and Gotzmann on the growth of Hilbert-Samuel functions.

0

Turn this paper into a lesson

ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…