An equivalence theorem for regular differential chains
The main purpose of the paper is the study of regularity properties of the image of a polynomial in a residue class ring using resultant computations. More precisely, let \(K\) be a field of characteristic zero and \(R = K[t_1, \ldots , t_m, x_1, \ldots , x_n]\) be a polynomial ring in \(n +m\) variables. Assume that that \(x_1 < x_2 < \cdots < x_n\). To each polynomial \(p \in R \setminus K\), one associates its leading variable, denoted by \(\mathrm{ld}(p)\), which is the highest variable appearing in \(p\). A finite set \(A = \{p_1, \ldots , p_n\}\) of \(R\) is called triangular if \(\mathrm{ld}(p_k) = x_k\) for each \(k\). The initial of \(p_k\), denoted by \(i_k\), is the leading coefficient of \(p_k\) w.r.t. its leading variable. Let \(A\) be a triangular set. Then, we define \(\mathrm{sat} (A) = (A) : (i_1 \cdots i_n)^\infty\). A triangular set is said to be a regular chain if the initial \(i_k\) of \(p_k\) is regular in \(R/ \mathrm{sat}(p_1, \ldots , p_{k-1})\) for each \(k\). The main contribution of the paper consists in showing that the following conditions are equivalent: 1) \(A\) is a regular chain; 2) for each \(2 \le \ell \le n\) and each \(1 \le k \le n\) we have \(\mathrm{res}(i_\ell, \{p_k, \ldots , p_n\})\) regular in \(R/\mathrm{sat}(A)\); 3) for each \(2 \le \ell \le n\) we have \(\mathrm{res}(i_\ell, A) \ne 0\); 4) for each \(f\in R\), \(f\) is regular in \(R/\mathrm{sat}(A)\) if and only if \(\mathrm{res}( f , A) \ne 0\); 5) for each \(f\in R\), \(f\) is regular in \(R/\mathrm{sat}(A)\) if and only if for each \(1 \le k \le n\), \(\mathrm{res}( f , \{p_k, \ldots , p_n\})\) is regular in \(R/\mathrm{sat}(A)\).
- A complete algorithm for automated discovering of a class of inequality-type theorems
- A generalized Euclidean algorithm for computing triangular representations of algebraic varieties
- A new method for solving algebraic systems of positive dimension
- Algebraic transformation of differential characteristic decompositions from one ranking to another
- Algorithmic Thomas decomposition of algebraic and differential systems
- Algorithms in real algebraic geometry
- Associative differential operations
- Automatique et corps différentiels
- Characteristic set method for differential-difference polynomial systems
- Coherent, regular and simple systems in zero decompositions of partial differential systems.
- Complexity of quantifier elimination in the theory of ordinary differential equations
- Comprehensive Triangular Decomposition
- Computing differential characteristic sets by change of ordering
- Computing representations for radicals of finitely generated differential ideals
- Computing triangular systems and regular systems
- Factorization-free decomposition algorithms in differential algebra
- Formal algorithmic elimination for PDEs
- scientific article; zbMATH DE number 1824068 (Why is no real title available?)
- scientific article; zbMATH DE number 5722788 (Why is no real title available?)
- scientific article; zbMATH DE number 1185962 (Why is no real title available?)
- scientific article; zbMATH DE number 3181273 (Why is no real title available?)
- scientific article; zbMATH DE number 1254247 (Why is no real title available?)
- scientific article; zbMATH DE number 622670 (Why is no real title available?)
- scientific article; zbMATH DE number 1979251 (Why is no real title available?)
- scientific article; zbMATH DE number 1979252 (Why is no real title available?)
- scientific article; zbMATH DE number 3415973 (Why is no real title available?)
- On global identifiability for arbitrary model parametrizations
- On the dimension of an arbitrary ascending chain
- On the regularity property of differential polynomials modulo regular differential chains
- On the theories of triangular sets
- Specializations in Differential Algebra
- The differential ideal \([P] : M^ \infty\).
- Unmixed-dimensional decomposition of a finitely generated perfect differential ideal
- A short contribution to the theory of regular chains
- On the regularity property of differential polynomials modulo regular differential chains
- When does \((T)\) equal \(\mathrm{sat}(T)\)?
- When does \(\langle T \rangle\) equal \(\text{sat}(T)\)?
- Transforming radical differential equations to algebraic differential equations
- On formal power series solutions of regular differential chains
- Infinite matroids in tropical differential algebra
- Simple characteristic decomposition of polynomial sets
- Periodic Pólya urns, the density method and asymptotics of Young tableaux
Uses Software
This page was built for publication: An equivalence theorem for regular differential chains
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1733300)
