3 papers
math.AC2007
Degree Bounds for Gröbner Bases in Algebras of Solvable Type
Matthias Aschenbrenner, Anton Leykin
We establish doubly-exponential degree bounds for Gröbner bases in certain algebras of solvable type over a field (as introduced by Kandri-Rody and Weispfenning). The class of alge…
math.RA2002
Algorithmic proofs of two theorems of Stafford
Anton Leykin
Two classical results of Stafford say that every (left) ideal of the -th Weyl algebra can be generated by two elements, and every holonomic -module is cyclic, i.e. ge…
math.AG2000
Definitive Computation of Bernstein-Sato Polynomials
Anton Leykin
Let n and d be positive integers, let k be a field and let P(n,d;k) be the space of the polynomials in n variables of degree at most d with coefficients in k. Let B(n,d) be the set…