A bound for orders in differential Nullstellensatz
characteristic setdifferential algebradifferential eliminationdifferential Nullstellensatzradical differential idealring of differential polynomials
Recursive functions and relations, subrecursive hierarchies (03D20) Differential algebra (12H05) Commutative rings of differential operators and their modules (13N10) Gröbner bases; other bases for ideals and modules (e.g., Janet and border bases) (13P10) Solving polynomial systems; resultants (13P15)
Let \(\mathbf k\) be a \textit{differential field} of characteristic 0, i.e., a field of characteristic 0 endowed with a finite set of derivations \(\Delta = \{{\partial}_1, \dots ,{\partial}_m\}\). Let \({\mathcal R} = \mathbf k\{y_1, \dots ,y_n\}\) be the \textit{ring of differential polynomials} in the \textit{differential indeterminates} \(y_1, \dots ,y_n\). As a ring, \(\mathcal R\) is the polynomial ring over \(\mathbf k\) in the infinite set of indeterminates \({\partial}^{\alpha}y_j\), \(\alpha \in {\mathbb N}^m\), \(1 \leq j \leq n\). The derivations \({\partial}_1, \dots ,{\partial}_m\) can be extended to derivations on \(\mathcal R\) in an obvious manner. An ideal \(I\) of the ring \(\mathcal R\) is called a \textit{differential ideal} if \({\partial}_i(I) \subseteq I\), \(i = 1, \dots ,m\). If \(F\) is a subset of \(\mathcal R\) then the differential ideal \([F]\) generated by \(F\) is the union of the algebraic ideals \((F^{(\leq h)})\) generated by the sets \(F^{(\leq h)}\) consisting of the elements \({\partial}^{\alpha}f\), where \(f \in F\), \(\alpha \in {\mathbb N}^m\) and \(|\, \alpha \, | \leq h\), for \(h \geq 0\). A well-known lemma asserts that if \(g^d \in (F)\) then \(({\partial}_ig)^{2d-1} \in (F^{(\leq d)})\), \(i = 1, \dots , m\). It follows that the algebraic radical of a differential ideal is a differential ideal. Now, let \(H\) and \(D\) be positive integers, \(F\) a finite subset of \(\mathcal R\) and \(g\) an element of \(\mathcal R\) such that \(g\) and the elements of \(F\) are polynomials in the indeterminates \({\partial}^{\alpha}y_j\), \(1 \leq j \leq n\), \(\alpha \in {\mathbb N}^m\), \(| \, \alpha \, | \leq H\), of degrees \(\leq D\). The main result of the paper asserts that if \(g\) belongs to the radical of \([F]\) then there exists a positive integer \(t \leq A(m+8,\text{max}(n,H,D))\) such that \(g\) belongs to the radical of \((F^{(\leq t)})\). Here \(A\) is the \textit{Ackermann function} defined recursively by: \[ \begin{gathered} A(0,n) = n+1,\;A(m+1,0) = A(m,1),\\ A(m+1,n+1) = A(m,A(m+1,n))\, .\end{gathered} \] This result answers a question addressed by \textit{A. Seidenberg} [``An elimination theory for differential algebra, Univ. California Publ. Math., n. Ser. 3, 31--66 (1957; Zbl 0083.03302)]. The proof uses differential elimination techniques for which the basic reference is the book of [\textit{E.R. Kolchin}, Differential algebra and algebraic groups. Pure and Applied Mathematics, 54, Academic Press, New York (1973; Zbl 0264.12102)]. The Ackermann function appears through a result of [\textit{G. Moreno Socias}, An Ackermannian polynomial ideal. Applied algebra, algebraic algorithms and error-correcting codes, Proc. 9th Int. Symp., AAECC-9, New Orleans/LA (USA) 1991, Lect. Notes Comput. Sci. 539, 269--280 (1991; Zbl 0781.13017)] about the length of \textit{Dicksonian sequences} in \({\mathbb N}^n\).
- On bounds for the effective differential Nullstellensatz
- New effective differential Nullstellensatz
- Effective differential Nullstellensatz for ordinary DAE systems with constant coefficients
- A bound for the order of characteristic set elements of an ordinary prime differential ideal and some applications
- A nullstellensatz and a positivstellensatz for ordered differential fields
- A bound for the Rosenfeld-Gröbner algorithm
- A combinatorial proof of the effective Nullstellensatz
- A resultant theory for the systems of two ordinary algebraic differential equations
- Associative differential operations
- Bounds for the degrees in the Nullstellensatz
- Complexity of quantifier elimination in the theory of ordinary differential equations
- Computing canonical representatives of regular differential ideals
- Computing representations for radicals of finitely generated differential ideals
- Factorization-free decomposition algorithms in differential algebra
- Galois theory of parameterized differential equations and linear differential algebraic groups
- scientific article; zbMATH DE number 1824068 (Why is no real title available?)
- scientific article; zbMATH DE number 3135927 (Why is no real title available?)
- scientific article; zbMATH DE number 3135928 (Why is no real title available?)
- scientific article; zbMATH DE number 3700811 (Why is no real title available?)
- scientific article; zbMATH DE number 177881 (Why is no real title available?)
- scientific article; zbMATH DE number 4123298 (Why is no real title available?)
- scientific article; zbMATH DE number 1254247 (Why is no real title available?)
- scientific article; zbMATH DE number 1252509 (Why is no real title available?)
- scientific article; zbMATH DE number 1979252 (Why is no real title available?)
- scientific article; zbMATH DE number 1446863 (Why is no real title available?)
- scientific article; zbMATH DE number 3415973 (Why is no real title available?)
- Improvements to a triangulation-decomposition algorithm for ordinary differential systems in higher degree cases
- Length of Polynomial Ascending Chains and Primitive Recursiveness.
- Model Theory
- Nullstellensatz effectif et Conjecture de Serre (Théorème de Quillen-Suslin) pour le Calcul Formel
- On the complexity of the resolvent representation of some prime differential ideals
- On the effective Nullstellensatz
- Sharp Effective Nullstellensatz
- Sharp estimates for the arithmetic Nullstellensatz
- The complexity of the word problems for commutative semigroups and polynomial ideals
- The D-Neumann problem
- Unmixed-dimensional decomposition of a finitely generated perfect differential ideal
- 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
- Derivations and invariant real ideals
- 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
- Orders of derivatives in decomposition of radical differential ideals
- Linear sparse differential resultant formulas
- Localization of Rota-Baxter algebras
- scientific article; zbMATH DE number 177881 (Why is no real title available?)
- Length of Polynomial Ascending Chains and Primitive Recursiveness.
- An upper bound for the order of a differential algebraic variety
- A nullstellensatz and a positivstellensatz for ordered differential fields
- Algorithms yield upper bounds in differential algebra
- Differential elimination and algebraic invariants of polynomial dynamical systems
- 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
This page was built for publication: A bound for orders in differential Nullstellensatz
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2267443)