✦ LIBER ✦

Algorithm for Computing Bernstein–Sato Ideals Associated with a Polynomial Mapping

✍ Scribed by Rouchdi Bahloul

Publisher: Elsevier Science
Year: 2001
Tongue: English
Weight: 329 KB
Volume: 32
Category: Article
ISSN: 0747-7171
DOI: 10.1006/jsco.2001.0487

No coin nor oath required. For personal study only.

✦ Synopsis

Let f 1 , . . . , fp be polynomials in n variables with coefficients in a field K. We associate with these polynomials a number of functional equations and related ideals B, B j and B Σ of K[s 1 , . . . , sp] called Bernstein-Sato ideals. Using standard basis techniques, our aim is to present an algorithm for computing generators of B j and B Σ .

📜 SIMILAR VOLUMES

Constructibility of the Set of Polynomia

Constructibility of the Set of Polynomials with a Fixed Bernstein–Sato Polynomial: an Algorithmic Approach

✍ Anton Leykin 📂 Article 📅 2001 🏛 Elsevier Science 🌐 English ⚖ 279 KB

Let n and d be positive integers, let k be a field and let P(n, d; k) be the space of the non-zero 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 character