
TL;DR
This paper establishes an upper bound on the leading coefficient of the Hilbert-Kolchin polynomial for certain D-modules, using complexity bounds for solving linear systems over fractional algebras.
Contribution
It introduces a novel upper bound for the Hilbert-Kolchin polynomial's leading coefficient in D-modules, leveraging complexity analysis of linear systems over fractional algebras.
Findings
Derived an explicit upper bound for the Hilbert-Kolchin polynomial's leading coefficient.
Connected complexity bounds of linear systems to properties of D-modules.
Applicable to modules with differential type t and orders up to d.
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
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsMatrix Theory and Algorithms · Polynomial and algebraic computation · Algebraic and Geometric Analysis
