Definitive Computation of Bernstein-Sato Polynomials
From MaRDI portal
Publication:6470313
arXivmath/0003155MaRDI QIDQ6470313FDOQ6470313
Authors: Anton Leykin 
Publication date: 24 March 2000
Abstract: 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 of the Bernstein-Sato polynomials of all polynomials in P(n,d;k) as k varies over all fields of characteristic 0. G. Lyubeznik proved that B(n,d) is a finite set and asked if, for a fixed k, the set of the polynomials corresponding to each element of B(n,d) is a constructible subset of P(n,d;k). In this paper we give an affirmative answer to Lyubeznik's question by showing that the set in question is indeed constructible and defined over Q, i.e. its defining equations are the same for all fields k. Moreover, we construct an algorithm that for each pair (n,d) produces a complete list of the elements of B(n,d) and, for each element of this list, an explicit description of the constructible set of polynomials having this particular Bernstein-Sato polynomial.
Gröbner bases; other bases for ideals and modules (e.g., Janet and border bases) (13P10) Rings of differential operators (associative algebraic aspects) (16S32) Effectivity, complexity and computational aspects of algebraic geometry (14Q20)
This page was built for publication: Definitive Computation of Bernstein-Sato Polynomials
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6470313)
