A bound for orders in differential Nullstellensatz

DOI10.1016/j.jalgebra.2009.05.032zbMath1189.12002arXiv0803.0160MaRDI QIDQ2267443

Alexey Ovchinnikov, Oleg Golubitsky, Marina Kondratieva, Agnes Szanto

Publication date: 1 March 2010

Published in: Journal of Algebra (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/0803.0160

zbMATH Keywords

differential algebra; differential elimination; characteristic set; differential Nullstellensatz; ring of differential polynomials; radical differential ideal

Mathematics Subject Classification ID

13P10: Gröbner bases; other bases for ideals and modules (e.g., Janet and border bases)

13N10: Commutative rings of differential operators and their modules

12H05: Differential algebra

03D20: Recursive functions and relations, subrecursive hierarchies

13P15: Solving polynomial systems; resultants

Related Items

Algorithms yield upper bounds in differential algebra, Linear sparse differential resultant formulas, Localization of Rota-Baxter algebras, Differential elimination by differential specialization of Sylvester style matrices, A decision method for the integrability of differential-algebraic Pfaffian systems, Effective uniform bounding in partial differential fields, On bounds for the effective differential Nullstellensatz, New effective differential Nullstellensatz, Effective bounds for the consistency of differential equations, Proof mining and effective bounds in differential polynomial rings, Elimination theory in differential and difference algebra, Nonstandard methods for bounds in differential polynomial rings, An upper bound for minimizing coefficients of the Kolchin dimension polynomial, Symmetry-based algorithms for invertible mappings of polynomially nonlinear PDE to linear PDE, Multiplicity-preserving triangular set decomposition of two polynomials, Sparse differential resultant for Laurent differential polynomials, A triangular decomposition algorithm for differential polynomial systems with elementary computation complexity, New order bounds in differential elimination algorithms, Effective differential Nullstellensatz for ordinary DAE systems with constant coefficients

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A bound for the Rosenfeld-Gröbner algorithm
• Computing representations for radicals of finitely generated differential ideals
• Bounds for the degrees in the Nullstellensatz
• A resultant theory for the systems of two ordinary algebraic differential equations
• Factorization-free decomposition algorithms in differential algebra
• The complexity of the word problems for commutative semigroups and polynomial ideals
• Sharp estimates for the arithmetic Nullstellensatz
• A combinatorial proof of the effective Nullstellensatz
• On the complexity of the resolvent representation of some prime differential ideals
• The D-Neumann problem
• On the effective Nullstellensatz
• Associative differential operations
• Nullstellensatz effectif et Conjecture de Serre (Théorème de Quillen-Suslin) pour le Calcul Formel
• Computing canonical representatives of regular differential ideals
• Length of Polynomial Ascending Chains and Primitive Recursiveness.
• Improvements to a triangulation-decomposition algorithm for ordinary differential systems in higher degree cases
• Sharp Effective Nullstellensatz
• Model Theory
• Complexity of quantifier elimination in the theory of ordinary differential equations
• Galois theory of parameterized differential equations and linear differential algebraic groups
• Unmixed-dimensional decomposition of a finitely generated perfect differential ideal