Buscar
Mostrando ítems 1-8 de 8
Capítulo de Libro
Nouvelle Cuisine for the Computation of the Annihilating Ideal of $f^s$
(2005)
Let $f_1,\ldots, f_p$ be polynomials in ${\bf C}[x_1,\ldots, x_n]$ and let $D = D_n$ be the $n$-th Weyl algebra. The annihilating ideal of $f^s=f_1^{s_1}\cdots f_p^{s_p}$ in $D[s]=D[s_1,\ldots,s_p]$ is a necessary step ...
Artículo
Localization at hyperplane arrangements: combinatorics and D-modules
(Elsevier, 2007-10-15)
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 ...
Ponencia
The Chemist's Cabinet Puzzle: a polynomial approach
(Universidad de Granada. Departamento de Álgebra, 2008-09)
Realizamos un análisis del juego conocido por el herbolario. Se modeliza su solución mediante un sistema polinómico, y deducimos el número de soluciones a partir de herramientas de Álgebra Conmutativa.
Artículo
Comparison of theoretical complexities of two methods for computing annihilating ideals of polynomials
(2005)
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, . ...
Capítulo de Libro
Algorithmic Invariants for Alexander Modules
(2006)
Let $G$ be a group given by generators and relations. It is possible to compute a presentation matrix of a module over a ring through Fox's differential calculus. We show how to use Gröbner bases as an algorithmic tool ...
Capítulo de Libro
Sudokus and Gröbner Bases: not only a Divertimento
(2006)
Sudoku is a logic-based placement puzzle. We recall how to translate this puzzle into a 9-colouring problem which is equivalent to a (big) algebraic system of polynomial equations. We study how far Gröbner bases techniques ...
Artículo
A computational approach to the D-module of meromorphic functions
(2001)
Let D be a divisor in Cn. We present methods to compare the D-module of the meromorphic functions O[∗D] to some natural approximations. We show how the analytic case can be treated with computations in the Weyl algebra.
Artículo
Free divisors and duality for D-modules
(Pleiades, 2002)
The relationship between D-modules and free divisors has been studied in a general setting by L. Narváez and F.J. Calderón. Using the ideas of these works we prove in this article a duality formula between two D-modules ...