Abstract
The Ritt problem asks if there is an algorithm that decides whether one prime differential ideal is contained in another one if both are given by their characteristic sets. We give several equivalent formulations of this problem. In particular, we show that it is equivalent to testing whether a differential polynomial is a zero divisor modulo a radical differential ideal. The technique used in the proof of this equivalence yields algorithms for computing a canonical decomposition of a radical differential ideal into prime components and a canonical generating set of a radical differential ideal. Both proposed representations of a radical differential ideal are independent of the given set of generators and can be made independent of the ranking.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
F. Boulier, D. Lazard, F. Ollivier, and M. Petitot, “Representation for the radical of a finitely generated differential ideal,” in: ISSAC’95. Proc. 1995 Int. Symp. Symbolic and Algebraic Computation, ACM Press, New York (1995), pp. 158–166.
F. Boulier and F. Lemaire, “Computing canonical representatives of regular differential ideals,” in: ISSAC’00. Proc. 2000 Int. Symp. Symbolic and Algebraic Computation, ACM Press, New York (2000), pp. 38–47.
R. M. Cohn, “Specializations of differential kernels and the Ritt problem,” J. Algebra, 61, No. 1, 256–268 (1979).
R. M. Cohn, “Valuations and the Ritt problem,” J. Algebra, 101, No. 1, 1–15 (1986).
D. Cox, J. Little, and D. O’Shea, Ideals, Varieties, and Algorithms: An Introduction to Computational Algebraic Geometry and Commutative Algebra, Springer (1996).
D. Eisenbud, C. Huneke, and V. Vasconcelos, “Direct methods for primary decomposition,” Invent. Math., 110, 207–235 (1992).
O. Golubitsky, “Gröbner fan and universal characteristic sets of prime differential ideals,” J. Symbolic Comput., 41, No. 10, 1091–1104 (2006).
O. Golubitsky, M. V. Kondratieva, and A. Ovchinnikov, “Algebraic transformation of differential characteristic decompositions from one ranking to another,” J. Symbolic Comput., 44 (2009).
E. Hubert, “Factorization-free decomposition algorithms in differential algebra,” J. Symbolic Comput., 29, No. 4–5, 641–662 (2000).
E. Hubert, “Notes on triangular sets and triangulation-decomposition algorithms. I. Polynomial systems,” in: F. Winkler, ed., Symbolic and Numerical Scientific Computation. Second Int. Conf., SNSC 2001, Hagenberg, Austria, September 12–14, 2001, Lect. Notes Comput. Sci., Vol. 2630, Springer, Berlin (2003), pp. 1–39.
E. Hubert, “Notes on triangular sets and triangulation-decomposition algorithms. II. Differential systems,” in: F. Winkler, ed., Symbolic and Numerical Scientific Computation. Second Int. Conf., SNSC 2001, Hagenberg, Austria, September 12–14, 2001, Lect. Notes Comput. Sci., Vol. 2630, Springer, Berlin (2003), pp. 40–87.
E. R. Kolchin, Differential Algebra and Algebraic Groups, Academic Press (1973).
M. V. Kondratieva, A. B. Levin, A. V. Mikhalev, and E. V. Pankratiev, Differential and Difference Dimension Polynomials, Kluwer Academic (1999).
H. Levi, “On the structure of differential polynomials and on their theory of ideals,” Trans. Am. Math. Soc., 51, 532–568 (1942).
R. G. Miller, “Computable fields and Galois theory,” Not. Am. Math. Soc., 55, No. 7, 798–807 (2008).
R. G. Miller, “Computability and differential fields: A tutorial,” in: L. Guo and W. Sit, Proc. Second Int. Workshop on Differential Algebra and Related Topics, to appear (2008).
M. O. Rabin, “Computable algebras, general theory and theory of computable fields,” Trans. Am. Math. Soc., 95, No. 2, 341–360 (1960).
J. F. Ritt, Differential Algebra, Amer. Math. Soc., New York (1950).
W. Y. Sit, “The Ritt–Kolchin theory for differential polynomials,” in: L. Guo, ed., Proc. Int. Workshop on Differential Algebra and Related Topics, Rutgers—The State University of New Jersey, New Brunswick, USA, November 2–3, 2000, World Scientific, Singapore (2002), pp. 1–70.
F. Winkler, Polynomial Algorithms in Computer Algebra, Springer, New York (1996).
Author information
Authors and Affiliations
Corresponding author
Additional information
To our advisor, Eugeny V. Pankratiev
Translated from Fundamentalnaya i Prikladnaya Matematika, Vol. 14, No. 4, pp. 109–120, 2008.
Rights and permissions
About this article
Cite this article
Golubitsky, O.D., Kondratieva, M.V. & Ovchinnikov, A.I. On the generalized Ritt problem as a computational problem. J Math Sci 163, 515–522 (2009). https://doi.org/10.1007/s10958-009-9689-3
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10958-009-9689-3