Algebraic transformation of differential characteristic decompositions from one ranking to another
From MaRDI portal
(Redirected from Publication:1008569)
Abstract: We study the concept of canonical characteristic set of a characterizable differential ideal. We propose an efficient algorithm that transforms any characteristic set into the canonical one. We prove the basic properties of canonical characteristic sets. In particular, we show that in the ordinary case for any ranking the order of each element of the canonical characteristic set of a characterizable differential ideal is bounded by the order of the ideal. Finally, we propose a factorization-free algorithm for computing the canonical characteristic set of a characterizable differential ideal represented as a radical ideal by a set of generators. The algorithm is not restricted to the ordinary case and is applicable for an arbitrary ranking.
Recommendations
- RANK PROBLEMS FOR COMPOSITE TRANSFORMATIONS
- Transformations to rank structures by unitary similarity
- Computing differential characteristic sets by change of ordering
- The rank of projection-algebraic representations of some differential operators
- Transformation properties for Dyson's rank function
- scientific article; zbMATH DE number 2065261
- Matrix decompositions using displacement rank and classes of commutative matrix algebras
- Commutative algebra of statistical ranking
- scientific article; zbMATH DE number 7642635
Cites work
- scientific article; zbMATH DE number 1824068 (Why is no real title available?)
- scientific article; zbMATH DE number 15047 (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 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?)
- A bound for the Rosenfeld-Gröbner algorithm
- A bound for the order of characteristic set elements of an ordinary prime differential ideal and some applications
- A notion of Krull dimension for differential rings
- Associative differential operations
- Change of ordering for regular chains in positive dimension
- Computing canonical representatives of regular differential ideals
- Computing characteristic sets of ordinary radical differential ideals
- Differential Dimension Polynomials of Finitely Generated Extensions
- Factorization-free decomposition algorithms in differential algebra
- Gröbner fan and universal characteristic sets of prime differential ideals
- Involutive bases of polynomial ideals
- Jacobi's bound for systems of algebraic differential equations
- PARDI!
- Resolvent representation for regular differential ideals
- Some properties of the lattice points and their application to differential algebra*
- The RegularChains library in Maple 10
Cited in
(11)- Computing differential characteristic sets by change of ordering
- A criterion for testing whether a difference ideal is prime
- Differential Elimination for Dynamical Models via Projections with Applications to Structural Identifiability
- Quantitative aspects of the generalized differential Lüroth's theorem
- Intersection theory in differential algebraic geometry: generic intersections and the differential Chow form
- An equivalence theorem for regular differential chains
- Computation of differential Chow forms for ordinary prime differential ideals
- Probabilistic algorithms for computing resolvent representations of regular differential ideals
- On the generalized Ritt problem as a computational problem
- PARDI!
- Universal characteristic decomposition of radical differential ideals
This page was built for publication: Algebraic transformation of differential characteristic decompositions from one ranking to another
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1008569)
