Buscar
Mostrando ítems 1-10 de 12
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
Exact cost minimization of a series-parallel reliable system with multiple component choices using an algebraic method
(2013-11)
The redundancy allocation problem is formulated minimizing the design cost for a series-parallel system with multiple component choices while ensuring a given system reliability level. The obtained model is a nonlinear ...
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 ...
Artículo
An algebraic approach to Integer Portfolio problems
(2011-05-01)
Integer variables allow the treatment of some portfolio optimization problems in a more realistic way and introduce the possibility of adding some natural features to the model. We propose an algebraic approach to ...
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 ...
Artículo
An improved test set approach to nonlinear integer problems with applications to engineering design
(Springer, 2015-11)
Many problems in engineering design involve the use of nonlinearities and some integer variables. Methods based on test sets have been proposed to solve some particular problems with integer variables, but they have not ...
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.