Let f1, . . . , fp be polynomials in C[x1, . . . , xn] and let D = Dn be the n-th Weyl algebra. The annihilating ideal of fs = f1 1 · · · f sp p in D[s] = D[s1, . . . , sp] is a necessary step for the computation of the Bernstein-Sato ideals of f1, . . . , fp. We point out experimental differences among the efficiency of the available methods to obtain this annihilating ideal and provide some u...

We propose a efficient method to calculate “the minimal annihilating polynomials” for all the unit vectors, of square matrix over the integers or the rational numbers. The minimal annihilating polynomials are useful for improvement of efficiency in wide variety of algorithms in exact linear algebra. We propose a efficient algorithm for calculating the minimal annihilating polynomials for all th...

In this paper we continue to study the strongly annihilating-submodule graph. addition providing more properties of graph, compare extensively graph with