Localization at hyperplane arrangements: combinatorics and D-modules
We describe an algorithm deciding if the annihilating ideal of the meromorphic function 1 f , where f = 0 defines an arrangement of hyperplanes, is generated by linear differential operators of order 1. The algorithm is based on the comparison of two characteristic cycles and uses a combinatorial de...
| Autores: | , , |
|---|---|
| Formato: | artículo |
| Estado: | Versión enviada para evaluación y publicación |
| Fecha de publicación: | 2007 |
| País: | España |
| Recursos: | Universidad de Sevilla (US) |
| Repositorio: | idUS. Depósito de Investigación de la Universidad de Sevilla |
| OAI Identifier: | oai:idus.us.es:11441/45019 |
| Acesso em linha: | http://hdl.handle.net/11441/45019 https://doi.org/10.1016/j.jalgebra.2006.12.006 |
| Access Level: | acceso abierto |
| Palavra-chave: | Characteristic cycle Localization Hyperplane arrangements Logarithmic D-modules Gröbner bases |
| Resumo: | We describe an algorithm deciding if the annihilating ideal of the meromorphic function 1 f , where f = 0 defines an arrangement of hyperplanes, is generated by linear differential operators of order 1. The algorithm is based on the comparison of two characteristic cycles and uses a combinatorial description due to Alvarez-Montaner, García–López and Zarzuela of the characteristic cycle of the D-module of meromorphic functions with respect to f. |
|---|