Artículo
Comparison of theoretical complexities of two methods for computing annihilating ideals of polynomials
Autor/es | Gago Vargas, Manuel Jesús
Hartillo Hermoso, Isabel Ucha Enríquez, José María |
Departamento | Universidad de Sevilla. Departamento de Álgebra |
Fecha de publicación | 2005 |
Fecha de depósito | 2015-03-27 |
Publicado en |
|
Resumen | Let f1, . . . , fp be polynomials in C[x1, . . . , xn] and let D = Dn be the n-th Weyl algebra. We provide upper bounds for the complexity of computing the annihilating ideal of f s = f s1 1 · · · f sp p in D[s] = D[s1, . ... Let f1, . . . , fp be polynomials in C[x1, . . . , xn] and let D = Dn be the n-th Weyl algebra. We provide upper bounds for the complexity of computing the annihilating ideal of f s = f s1 1 · · · f sp p in D[s] = D[s1, . . . , sp]. These bounds provide an initial explanation on the differences between the running times of the two methods known to obtain the so-called BernsteinSato ideals. |
Agencias financiadoras | Ministerio de Ciencia y Tecnología (MCYT). España |
Identificador del proyecto | MTM2004-01165
FQM-333 |
Ficheros | Tamaño | Formato | Ver | Descripción |
---|---|---|---|---|
complex_ann_2-ams.pdf | 324.9Kb | [PDF] | Ver/ | |