A Bound for a Typical Differential Dimension of Systems of Linear Differential Equations
Tóm tắt
We prove upper and lower bounds for the leading coefficient of Kolchin dimension polynomial of systems of partial linear differential equations in the case of codimension two, quadratic with respect to the orders of the equations in the system. A notion of typical differential dimension plays an important role in differential algebra, some of its estimations were proved by J. Ritt and E. Kolchin; they also advanced several conjectures that were later refuted. Our bound generalizes the analog of the Bézout theorem for one differential indeterminate. It is better than an estimation proved by D. Grigoriev.
Tài liệu tham khảo
F. Boulier, D. Lazard, F. Ollivier, and M. Petitot, “Computing representations for radicals of finitely generated differential ideals,” Appl. Algebra Eng., Commun. Comput., 20, No. 1, 73–121 (2009).
A. Chistov and D. Grigoriev, “Complexity of a standard basis of a D-module,” St. Petersburg Math. J., 20, 709–736 (2009).
T. Dubé, “The structure of polynomial ideals and Gröbner bases,” SIAM J. Comput., 19, No. 4, 750–773 (1990).
D. Grigoriev, “Weak Bezout inequality for D-modules,” J. Complexity, 21, 532–542 (2005).
E. Hubert, “Factorization-free decomposition algorithms in differential algebra,” J. Symbolic Comput., 29, No. 4-5, 641–662 (2000).
E. R. Kolchin, Differential Algebra and Algebraic Groups, Academic Press, London (1973).
M. V. Kondratieva, A. B. Levin, A. V. Mikhalev, and E. V. Pankratiev, Differential and Difference Dimension Polynomials, Kluwer Academic, Dordrecht (1999).
M. V. Kondratieva, “An upper bound for minimizing coefficients of dimension Kolchin polynomial,” Program. Comput. Software, 36, No. 2, 83–86 (2010).
E. W. Mayr and A. R. Meyer, “The complexity of a word problem for commutative semigroups and polynomial ideals,” Adv. Math., 46, 305–329 (1982).
J. Ritt, Differential Algebra, Amer. Math. Soc., New York (1950).