Weak Bezout inequality for D-modules
Symbolic Computation
2007-05-23 v1 Computational Complexity
Abstract
Let be linear partial differential operators of orders with respect to at most . 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 -module having the differential type (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
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