A bound for the Rosenfeld-Gröbner algorithm
From MaRDI portal
Publication:928772
DOI10.1016/j.jsc.2007.12.002zbMath1142.13024arXivmath/0702470MaRDI QIDQ928772
Oleg Golubitsky, Marc Moreno Maza, Marina Kondratieva, Alexey Ovchinnikov
Publication date: 11 June 2008
Published in: Journal of Symbolic Computation (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/math/0702470
differential algebra; characteristic sets; decomposition into regular components; radical differential ideals
13P10: Gröbner bases; other bases for ideals and modules (e.g., Janet and border bases)
13N99: Differential algebra
Related Items
Jacobi's bound: Jacobi's results translated in Kőnig's, Egerváry's and Ritt's mathematical languages, Computing constraint sets for differential fields, Probabilistic algorithms for computing resolvent representations of regular differential ideals, Algebraic transformation of differential characteristic decompositions from one ranking to another, The differential counting polynomial, Nonstandard methods for bounds in differential polynomial rings, A bound for orders in differential Nullstellensatz, A parameter-free model comparison test using differential algebra, New order bounds in differential elimination algorithms
Cites Work
- An elimination method for polynomial systems
- Factorization-free decomposition algorithms in differential algebra
- The differential ideal \([P : M^ \infty\).]
- Associative differential operations
- PARDI!
- Computing canonical representatives of regular differential ideals
- Improvements to a triangulation-decomposition algorithm for ordinary differential systems in higher degree cases
- Unmixed-dimensional decomposition of a finitely generated perfect differential ideal
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
