Now showing items 1-6 of 6
Constructions in R[x_1, ..., x_n]. Applications to K-Theory [Article]
A classical result in K-Theory about polynomial rings like the Quillen-Suslin theorem admits an algorithmic approach when the ring of coefficients has some computational properties, associated with Gröbner bases. There ...
Algorithmic Invariants for Alexander Modules [Chapter of Book]
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 ...
Localization at hyperplane arrangements: combinatorics and D-modules [Article]
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 ...
Sudokus and Gröbner Bases: not only a Divertimento [Chapter of Book]
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 ...
Minimal resolutions of lattice ideals and integer linear programming [Article]
(European Mathematical Society, 2003)
A combinatorial description of the minimal free resolution of a lattice ideal allows us to the connection of Integer Linear Programming and Algebra. The non null reduced homology spaces of some simplicial complexes are ...
Bases for Projective modules in An(k) [Article]
Let $A_n(k)$ be the Weyl algebra, with $k$ a field of characteristic zero. It is known that every projective finitely generated left module is free or isomorphic to a left ideal. Let $M$ be a left submodule of a free module. ...