Related papers: A Bivariate Preprocessing Paradigm for Buchberger-…
Algorithmic computation in polynomial rings is a classical topic in mathematics. However, little attention has been given to the case of rings with an infinite number of variables until recently when theoretical efforts have made possible…
In this paper we propose a fast algorithm for trivariate interpolation, which is based on the partition of unity method for constructing a global interpolant by blending local radial basis function interpolants and using locally supported…
In this paper we describe how an idea centered on the concept of self-saturation allows several improvements in the computation of Groebner bases via Buchberger's Algorithm.
Signature-based algorithms have brought large improvements in the performances of Gr\"obner bases algorithms for polynomial systems over fields. Furthermore, they yield additional data which can be used, for example, to compute the module…
In this paper, we study how to quickly compute the <-minimal monomial interpolating basis for a multivariate polynomial interpolation problem. We address the notion of "reverse" reduced basis of linearly independent polynomials and design…
Signature-based algorithms are the latest and most efficient approach as of today to compute Gr\"obner bases for polynomial systems over fields. Recently, possible extensions of these techniques to general rings have attracted the attention…
We construct an explicit minimal strong Groebner basis of the ideal of vanishing polynomials in the polynomial ring over Z/m for m>=2. The proof is done in a purely combinatorial way. It is a remarkable fact that the constructed Groebner…
We consider regular polynomial interpolation algorithms on recursively defined sets of interpolation points which approximate global solutions of arbitrary well-posed systems of linear partial differential equations. Convergence of the…
We study existence and computability of finite bases for ideals of polynomials over infinitely many variables. In our setting, variables come from a countable logical structure A, and embeddings from A to A act on polynomials by renaming…
We propose a method for the construction of preconditioners of parameter-dependent matrices for the solution of large systems of parameter-dependent equations. The proposed method is an interpolation of the matrix inverse based on a…
A contemporary and exciting application of Groebner bases is their use in computational biology, particularly in the reverse engineering of gene regulatory networks from experimental data. In this setting, the data are typically limited to…
On one hand, consider the problem of finding global solutions to a polynomial optimization problem and, on the other hand, consider the problem of interpolating a set of points with a complex exponential function. This paper proposes a…
We present Buchberger Theory and Algorithm of Gr\"obner bases for multivariate Ore extensions of rings presented as modules over a principal ideal domain. The algorithms are based on M\"oller Lifting Theorem.
We give algorithms for computing multiplier ideals using Gr\"obner bases in Weyl algebras. The algorithms are based on a newly introduced notion which is a variant of Budur--Musta\c{t}\v{a}--Saito's (generalized) Bernstein--Sato polynomial.…
Multiobjective discrete programming is a well-known family of optimization problems with a large spectrum of applications. The linear case has been tackled by many authors during the last years. However, the polynomial case has not been…
Resultants and Gr\"obner bases are crucial tools in studying polynomial elimination theory. We investigate relations between the variety of the resultant of two polynomials and the variety of the ideal they generate. Then we focus on the…
In this paper, a new reduction based interpolation algorithm for black-box multivariate polynomials over finite fields is given. The method is based on two main ingredients. A new Monte Carlo method is given to reduce black-box multivariate…
In this paper we present the formal, computer-supported verification of a functional implementation of Buchberger's critical-pair/completion algorithm for computing Gr\"obner bases in reduction rings. We describe how the algorithm can be…
We present a new rational approximation algorithm based on the empirical interpolation method for interpolating a family of parametrized functions to rational polynomials with invariant poles, leading to efficient numerical algorithms for…
This paper describes a Buchberger-style algorithm to compute a Groebner basis of a polynomial ideal, allowing for a selection strategy based on "signatures". We explain how three recent algorithms can be viewed as different strategies for…