Related papers: Algorithms for Bernstein-Sato polynomials and mult…

The NumericalHilbert package for Macaulay2 includes algorithms for computing local dual spaces of polynomial ideals, and related local combinatorial data about its scheme structure. These techniques are numerically stable, and can be used…

In this note we determine the Bernstein-Sato polynomial $b_Q(s)$ of a generic central arrangement $Q=\prod_{i=1}^kH_i$ of hyperplanes. We establish a connection between the roots of $b_Q(s)$ and the degrees of the generators for the top…

Let $C$ be a cusp in $(\mathbb C^2,\mathbf 0)$ with Puiseux pair $(n,m)$. This paper is devoted to show how the semimodule of differential values of $C$ determines a subset of the roots of the Bernstein-Sato polynomial of $C$. We add more…

In this paper we prove that the Bernstein-Sato polynomial of any free divisor for which the $D[s]$-module $D[s] h^s$ admits a Spencer logarithmic resolution satisfies the symmetry property $b(-s-2) = \pm b(s)$. This applies in particular to…

The resultant of two univariate polynomials is an invariant of great importance in commutative algebra and vastly used in computer algebra systems. Here we present an algorithm to compute it over Artinian principal rings with a modified…

We propose a novel approach to the problem of polynomial approximation of rational B\'ezier triangular patches with prescribed boundary control points. The method is very efficient thanks to using recursive properties of the bivariate dual…

We consider ordered pairs $(X,\mathcal{B})$ where $X$ is a finite set of size $v$ and $\mathcal{B}$ is some collection of $k$-element subsets of $X$ such that every $t$-element subset of $X$ is contained in exactly $\lambda$ "blocks" $B\in…

For fixed prime integer $p > 0$ we develop a notion of Bernstein-Sato polynomial for polynomials with $\mathbb{Z} / p^m$-coefficients, compatible with existing theory in the case $m = 1$. We show that the ``roots" of such polynomials are…

Modify the Blum-Shub-Smale model of computation replacing the permitted computational primitives (the real field operations) with any finite set $B$ of real functions semialgebraic over the rationals. Consider the class of boolean decision…

For a regular map $F$ from a complex smooth affine variety $X$ to $\mathbb A^r_\mathbb C$, we construct generalized nearby-cycle modules of a regular holonomic $\mathscr D$-module $\mathcal M$ along log strata with the log structure induced…

We study the problem of the computation of Groebner basis for the ideal of linear recurring relations of a doubly periodic array. We find a set of indexes such that, along with some conditions, guarantees that the set of polynomials…

Let X be a finite set of points in R^n. A polynomial p nonnegative on X can be written as a sum of squares of rational functions modulo the vanishing ideal I(X). From the point of view of applications, such as polynomial optimization, we…

We consider the problem of estimating the multiplicity of a polynomial when restricted to the smooth analytic trajectory of a (possibly singular) polynomial vector field at a given point or points, under an assumption known as the…

Let T(x) in k[x] be a monic non-constant polynomial and write R=k[x] / (T) the quotient ring. Consider two bivariate polynomials a(x, y), b(x, y) in R[y]. In a first part, T = p^e is assumed to be the power of an irreducible polynomial p. A…

Whenever available, refined BPS indices provide considerably more information on the spectrum of BPS states than their unrefined version. Extending earlier work on the modularity of generalized Donaldson-Thomas invariants counting D4-D2-D0…

In this survey, we use (more or less) elementary means to establish the well-known result that for any given smooth multivariate function, the respective multivariate Bernstein polynomials converge to that function in all derivatives on…

This paper deals with simultaneously fast and in-place algorithms for formulae where the result has to be linearly accumulated: some output variables are also input variables, linked by a linear dependency. Fundamental examples include the…

Let G be a locally compact group L^p(G) be the usual L^p-space for 1 =< p =< infty and A(G) be the Fourier algebra of G. Our goal is to study, in a new abstract context, the completely bounded multipliers of A(G), which we denote…

This paper is devoted to give all the technical constructions and definitions that will lead to the construction of an algorithm of resolution of singularities for binomial ideals. We construct a resolution function that will provide a…

Global polynomial optimization is an important tool across applied mathematics, with many applications in operations research, engineering, and physical sciences. In various settings, the polynomials depend on external parameters that may…