Algebraic transformation of differential characteristic decompositions from one ranking to another
From MaRDI portal
Publication:1008569
DOI10.1016/J.JSC.2008.07.002zbMATH Open1174.13036arXivmath/0702130OpenAlexW2027966173MaRDI QIDQ1008569FDOQ1008569
Oleg Golubitsky, Marina Kondratieva, Alexey Ovchinnikov
Publication date: 30 March 2009
Published in: Journal of Symbolic Computation (Search for Journal in Brave)
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.
Full work available at URL: https://arxiv.org/abs/math/0702130
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?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Involutive bases of polynomial ideals
- Associative differential operations
- A notion of Krull dimension for differential rings
- PARDI!
- Factorization-free decomposition algorithms in differential algebra
- Computing canonical representatives of regular differential ideals
- Resolvent representation for regular differential ideals
- A bound for the order of characteristic set elements of an ordinary prime differential ideal and some applications
- A bound for the Rosenfeld-Gröbner algorithm
- Some properties of the lattice points and their application to differential algebra*
- Differential Dimension Polynomials of Finitely Generated Extensions
- Jacobi's bound for systems of algebraic differential equations
- Gröbner fan and universal characteristic sets of prime differential ideals
Cited In (10)
- Intersection theory in differential algebraic geometry: generic intersections and the differential Chow form
- Computing differential characteristic sets by change of ordering
- Differential Elimination for Dynamical Models via Projections with Applications to Structural Identifiability
- Quantitative aspects of the generalized differential Lüroth's theorem
- Probabilistic algorithms for computing resolvent representations of regular differential ideals
- A criterion for testing whether a difference ideal is prime
- Computation of differential Chow forms for ordinary prime differential ideals
- Universal characteristic decomposition of radical differential ideals
- On the generalized Ritt problem as a computational problem
- An equivalence theorem for regular differential chains
Uses Software
Recommendations
- Title not available (Why is that?) 👍 👎
- Title not available (Why is that?) 👍 👎
- Matrix decompositions using displacement rank and classes of commutative matrix algebras 👍 👎
- Computing differential characteristic sets by change of ordering 👍 👎
- Transformations to rank structures by unitary similarity 👍 👎
- Commutative algebra of statistical ranking 👍 👎
- The rank of projection-algebraic representations of some differential operators 👍 👎
- Transformation properties for Dyson’s rank function 👍 👎
- RANK PROBLEMS FOR COMPOSITE TRANSFORMATIONS 👍 👎
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)
