Estimates for the coefficients of differential dimension polynomials
From MaRDI portal
Publication:5226667
DOI10.1090/MCOM/3429zbMATH Open1412.12004arXiv1703.00509OpenAlexW2964182935WikidataQ128442757 ScholiaQ128442757MaRDI QIDQ5226667FDOQ5226667
Authors: Omar León Sánchez
Publication date: 1 August 2019
Published in: Mathematics of Computation (Search for Journal in Brave)
Abstract: We answer the following long-standing question of Kolchin: given a system of algebraic-differential equations in 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 and ), 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.
Full work available at URL: https://arxiv.org/abs/1703.00509
Recommendations
- A bound for a typical differential dimension of systems of linear differential equations
- An upper bound for minimizing coefficients of the Kolchin dimension polynomial
- On bounds for the effective differential Nullstellensatz
- Some properties of coefficients of the Kolchin dimension polynomial
- The differential dimension polynomial for characterizable differential ideals
Differential algebra (12H05) Effectivity, complexity and computational aspects of algebraic geometry (14Q20)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Weak Bézout inequality for D-modules
- Completeness in partial differential algebraic geometry
- Title not available (Why is that?)
- Length of Polynomial Ascending Chains and Primitive Recursiveness.
- On bounds for the effective differential Nullstellensatz
- Title not available (Why is that?)
- Effective bounds for the consistency of differential equations
- An upper bound for minimizing coefficients of the Kolchin dimension polynomial
Cited In (10)
- Title not available (Why is that?)
- Some properties of coefficients of the Kolchin dimension polynomial
- A bound for a typical differential dimension of systems of linear differential equations
- Algorithms yield upper bounds in differential algebra
- The typical dimension of a system of first-order differential equations
- Effective bounds for the consistency of differential equations
- An upper bound for minimizing coefficients of the Kolchin dimension polynomial
- Effective definability of Kolchin polynomials
- Elimination of unknowns for systems of algebraic differential-difference equations
- A bound for the orders of the components of a system of algebraic difference equations
This page was built for publication: Estimates for the coefficients of differential dimension polynomials
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5226667)