Weak Bezout inequality for D-modules
Dima Grigoriev
Abstract
Let \wi,j\1≤ i≤ n, 1≤ j≤ s ⊂ Lm=F(X1,...,Xm)[∂ ∂ X1,..., ∂ ∂ Xm] be linear partial differential operators of orders with respect to ∂ ∂ X1,..., ∂ ∂ Xm at most d. We prove an upper bound n(4m2d\n,s\)4m-t-1(2(m-t)) on the leading coefficient of the Hilbert-Kolchin polynomial of the left Lm-module <\w1,j, ..., wn,j\1≤ j ≤ s > ⊂ Lmn having the differential type t (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 algebras of fractions of the form Lm(F[X1,..., Xm, ∂ ∂ X1,..., ∂ ∂ Xk])-1.
Create a lesson
Related papers
Probably correct row echelon form in the F4 algorithm
Alexander Demin
Parallel Integration over Simple Radical Extensions II: Mixed Towers
Sam Blake
Certified local rank and uniqueness barriers for a 48-term matrix-multiplication decomposition
Abhinav Agarwal
Fast matrix multiplication via recursive 4x4x4:48 algorithms into practice
Jean-Guillaume Dumas, Clément Pernet, Alexandre Sedoglavic et al.
Diversity of EML-type operators
Andrzej Odrzywołek
Physical Law Ecology: mapping multi-mechanism ecologies as the zeroth step of data-driven scientific discovery
Xiongheng Bian, Xiangyu Cui, Ma Feng et al.