English

Weak Bezout inequality for D-modules

Symbolic Computation 2007-05-23 v1 Computational Complexity

Abstract

Let {wi,j}1in,1jsLm=F(X1,...,Xm)[X1,...,Xm]\{w_{i,j}\}_{1\leq i\leq n, 1\leq j\leq s} \subset L_m=F(X_1,...,X_m)[{\partial \over \partial X_1},..., {\partial \over \partial X_m}] be linear partial differential operators of orders with respect to X1,...,Xm{\partial \over \partial X_1},..., {\partial \over \partial X_m} at most dd. We prove an upper bound n(4m^2d\min\{n,s\})^{4^{m-t-1}(2(m-t))} on the leading coefficient of the Hilbert-Kolchin polynomial of the left LmL_m-module <{w1,j,...,wn,j}1js>Lmn<\{w_{1,j}, ..., w_{n,j}\}_{1\leq j \leq s} > \subset L_m^n having the differential type tt (also being equal to the degree of the Hilbert-Kolchin polynomial). The main technical tool is the complexity bound on solving systems of linear equations over {\it algebras of fractions} of the form Lm(F[X1,...,Xm,X1,...,Xk])1.L_m(F[X_1,..., X_m, {\partial \over \partial X_1},..., {\partial \over \partial X_k}])^{-1}.

Cite

@article{arxiv.cs/0311053,
  title  = {Weak Bezout inequality for D-modules},
  author = {Dima Grigoriev},
  journal= {arXiv preprint arXiv:cs/0311053},
  year   = {2007}
}

Comments

10 pages