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 |
| id |
ES_5495c70f7d19fa2d95e199810b9d02c8 |
|---|---|
| oai_identifier_str |
oai:idus.us.es:11441/23600 |
| network_acronym_str |
ES |
| network_name_str |
España |
| repository_id_str |
|
| spelling |
Comparison of theoretical complexities of two methods for computing annihilating ideals of polynomialsGago Vargas, Manuel JesúsHartillo Hermoso, IsabelUcha Enríquez, José MaríaComplexityPoincaré-Birkhoff-Witt algebrasBernstein-Sato idealsLet 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.Ministerio de Ciencia y Tecnología MTM2004-01165Junta de Andalucía FQM-333ÁlgebraMinisterio de Ciencia y Tecnología (MCYT). España2005info:eu-repo/semantics/articleapplication/pdfapplication/pdfhttp://hdl.handle.net/11441/23600https://doi.org/10.1016/j.jsc.2005.05.004reponame:idUS. Depósito de Investigación de la Universidad de Sevillainstname:Universidad de Sevilla (US)InglésJournal of Symbolic Computation, 40(3), 1076-1086MTM2004-01165FQM-333http://doi.org/10.1016/j.jsc.2005.05.004http://dx.doi.org/10.1016/j.jsc.2005.05.004info:eu-repo/semantics/openAccessoai:idus.us.es:11441/236002026-06-17T12:51:07Z |
| dc.title.none.fl_str_mv |
Comparison of theoretical complexities of two methods for computing annihilating ideals of polynomials |
| title |
Comparison of theoretical complexities of two methods for computing annihilating ideals of polynomials |
| spellingShingle |
Comparison of theoretical complexities of two methods for computing annihilating ideals of polynomials Gago Vargas, Manuel Jesús Complexity Poincaré-Birkhoff-Witt algebras Bernstein-Sato ideals |
| title_short |
Comparison of theoretical complexities of two methods for computing annihilating ideals of polynomials |
| title_full |
Comparison of theoretical complexities of two methods for computing annihilating ideals of polynomials |
| title_fullStr |
Comparison of theoretical complexities of two methods for computing annihilating ideals of polynomials |
| title_full_unstemmed |
Comparison of theoretical complexities of two methods for computing annihilating ideals of polynomials |
| title_sort |
Comparison of theoretical complexities of two methods for computing annihilating ideals of polynomials |
| dc.creator.none.fl_str_mv |
Gago Vargas, Manuel Jesús Hartillo Hermoso, Isabel Ucha Enríquez, José María |
| author |
Gago Vargas, Manuel Jesús |
| author_facet |
Gago Vargas, Manuel Jesús Hartillo Hermoso, Isabel Ucha Enríquez, José María |
| author_role |
author |
| author2 |
Hartillo Hermoso, Isabel Ucha Enríquez, José María |
| author2_role |
author author |
| dc.contributor.none.fl_str_mv |
Álgebra Ministerio de Ciencia y Tecnología (MCYT). España |
| dc.subject.none.fl_str_mv |
Complexity Poincaré-Birkhoff-Witt algebras Bernstein-Sato ideals |
| topic |
Complexity Poincaré-Birkhoff-Witt algebras Bernstein-Sato ideals |
| description |
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. |
| publishDate |
2005 |
| dc.date.none.fl_str_mv |
2005 |
| dc.type.none.fl_str_mv |
info:eu-repo/semantics/article |
| format |
article |
| dc.identifier.none.fl_str_mv |
http://hdl.handle.net/11441/23600 https://doi.org/10.1016/j.jsc.2005.05.004 |
| url |
http://hdl.handle.net/11441/23600 https://doi.org/10.1016/j.jsc.2005.05.004 |
| dc.language.none.fl_str_mv |
Inglés |
| language_invalid_str_mv |
Inglés |
| dc.relation.none.fl_str_mv |
Journal of Symbolic Computation, 40(3), 1076-1086 MTM2004-01165 FQM-333 http://doi.org/10.1016/j.jsc.2005.05.004 http://dx.doi.org/10.1016/j.jsc.2005.05.004 |
| dc.rights.none.fl_str_mv |
info:eu-repo/semantics/openAccess |
| eu_rights_str_mv |
openAccess |
| dc.format.none.fl_str_mv |
application/pdf application/pdf |
| dc.source.none.fl_str_mv |
reponame:idUS. Depósito de Investigación de la Universidad de Sevilla instname:Universidad de Sevilla (US) |
| instname_str |
Universidad de Sevilla (US) |
| reponame_str |
idUS. Depósito de Investigación de la Universidad de Sevilla |
| collection |
idUS. Depósito de Investigación de la Universidad de Sevilla |
| repository.name.fl_str_mv |
|
| repository.mail.fl_str_mv |
|
| _version_ |
1869408194290253824 |
| score |
15,300724 |