Comparison of theoretical complexities of two methods for computing annihilating ideals of polynomials
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 betw...
| Autores: | , , |
|---|---|
| Tipo de recurso: | artículo |
| Fecha de publicación: | 2005 |
| País: | España |
| Institución: | Universidad de Sevilla (US) |
| Repositorio: | idUS. Depósito de Investigación de la Universidad de Sevilla |
| OAI Identifier: | oai:idus.us.es:11441/23600 |
| Acceso en línea: | http://hdl.handle.net/11441/23600 https://doi.org/10.1016/j.jsc.2005.05.004 |
| Access Level: | acceso abierto |
| Palabra clave: | Complexity Poincaré-Birkhoff-Witt algebras Bernstein-Sato ideals |
| Sumario: | 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. |
|---|