pith. sign in

arxiv: 0704.1257 · v1 · submitted 2007-04-10 · 🧮 math.AP · math.RA

Complexity of Janet basis of a D-module

classification 🧮 math.AP math.RA
keywords basisboundcomplexityjanetmodulealgebracasecommutative
0
0 comments X
read the original abstract

We prove a double-exponential upper bound on the degree and on the complexity of constructing a Janet basis of a $D$-module. This generalizes a well known bound on the complexity of a Gr\"obner basis of a module over the algebra of polynomials. We would like to emphasize that the obtained bound can not be immediately deduced from the commutative case.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.