Related papers: On polynomial interpolation in the monomial basis
We give a necessary and sufficient condition on a homogeneous polynomial ideal for its Taylor complex to be exact. Then we give a combinatorial construction of a minimal resolution for ideals satisfying the above condition (in particular…
In this paper, we investigate property testing whether or not a degree d multivariate poly- nomial is a sum of squares or is far from a sum of squares. We show that if we require that the property tester always accepts YES instances and…
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…
The Bohnenblust-Hille inequality and its variants have found applications in several areas of Mathematics and related fields. The control of the constants for the variant for complex $m$-homogeneous polynomials is of special interest for…
This paper introduces a new preconditioning technique that is suitable for matrices arising from the discretization of a system of PDEs on unstructured grids. The preconditioner satisfies a so-called filtering property, which ensures that…
In this paper, we first propose a general interpolation algorithm in a free module of a linearized polynomial ring, and then apply this algorithm to decode several important families of codes, Gabidulin codes, KK codes and MV codes. Our…
The concepts of evaluation and interpolation are extended from univariate skew polynomials to multivariate skew polynomials, with coefficients over division rings. Iterated skew polynomial rings are in general not suitable for this purpose.…
We provide formulas and algorithms for computing the excess numbers of certain ideals. The solution for monomial ideals is given by the mixed volumes of certain polytopes. These results enable us to design specific homotopies for numerical…
We show that a global holomorphic section of $\mathscr{O}(d)$ restricted to a closed complex subspace $X \subset \mathbb{P}^n$ has an interpolant if and only if it satisfies a set of moment conditions that involves a residue current…
It is known that every function with a finite support over a given field can be interpolated by means of the Lagrangian polynomial. The question is if a similar interpolation is possible if one considers a unitary ring or a Boolean algebra…
Many computer vision applications require robust estimation of the underlying geometry, in terms of camera motion and 3D structure of the scene. These robust methods often rely on running minimal solvers in a RANSAC framework. In this paper…
We present a new algorithm for isolating the real roots of a system of multivariate polynomials, given in the monomial basis. It is inspired by existing subdivision methods in the Bernstein basis; it can be seen as generalization of the…
Let G be a complex semisimple Lie group. The aim of this article is to compare two basis for G-modules, namely the standard monomial basis and the dual canonical basis. In particular, we give a sufficient condition for a standard monomial…
Let $R=K[x_1,...,x_n]$ be the polynomial ring in $n$ variables over a field $K$ and $I$ be a monomial ideal generated in degree $d$. Bandari and Herzog conjectured that a monomial ideal $I$ is polymatroidal if and only if all its monomial…
We study scalar multivariate non-stationary subdivision schemes with a general dilation matrix. We characterize the capability of such schemes to reproduce exponential polynomials in terms of simple algebraic conditions on their symbols.…
In this paper we present an algorithm for construction of minimal involutive polynomial bases which are Groebner bases of the special form. The most general involutive algorithms are based on the concept of involutive monomial division…
Let $K$ be a field, $V$ a finite dimensional $K$-vector space and $E$ the exterior algebra of $V$. We analyze iterated mapping cone over $E$. If $I$ is a monomial ideal of $E$ with linear quotients, we show that the mapping cone…
The template-based method is one of the most successful approaches to algebraic invariant synthesis. In this method, an algorithm designates a template polynomial p over program variables, generates constraints for p=0 to be an invariant,…
We study conditions on polynomials such that the ideal generated by their orbits under the symmetric group action becomes a monomial ideal or has a monomial radical. If the polynomials are homogeneous, we expect that such an ideal has a…
The efficient inversion of matrix polynomials is a critical challenge in computational mathematics. We design a procedure to determine the inverse of matrices polynomial of multidimensional Laplace matrices. The method is based on…