Related papers: On polynomial interpolation in the monomial basis
We present a FFT-based algorithm for the computation of a polynomial's coefficients from its roots, and apply it to obtain the coefficients of interpolation polynomials, to invert Vandermondians and to evaluate the symmetric functions of a…
In this paper we study the real rank of monomials and we give an upper bound for the real rank of all monomials. We show that the real and the complex ranks of a monomial coincide if and only if the least exponent is equal to one.
The purpose of this paper is to find a new way to prove the $n!$ conjecture for particular partitions. The idea is to construct a monomial and explicit basis for the space $M_{\mu}$. We succeed completely for hook-shaped partitions, i.e.,…
In this elementary paper we prove that the extra vanishing property characterizes the BC interpolation Macdonald polynomials inside a very general class of multivariate interpolation polynomials. It follows that they are the only…
We characterize monomial ideals which are intersections of monomial prime ideals and study classes of ideals with this property, among them polymatroidal ideals.
For which monomial supports do most polynomials generate a prime ideal? We give necessary and sufficient conditions for the radical of the ideal to be prime over an algebraically closed field. In characteristic zero, the same conditions…
In this work, we study the Hermite interpolation on $n$-dimensional non-equally spaced, rectilinear grids over a field $\Bbbk $ of characteristic zero, given the values of the function at each point of the grid and the partial derivatives…
Polynomial optimization problems over binary variables can be expressed as integer programs using a linearization with extra monomials in addition to those arising in the given polynomial. We characterize when such a linearization yields an…
The problem of interpolation at $(n+1)^2$ points on the unit sphere $\mathbb{S}^2$ by spherical polynomials of degree at most $n$ is proved to have a unique solution for several sets of points. The points are located on a number of circles…
In this paper we describe an efficient involutive algorithm for constructing Groebner bases of polynomial ideals. The algorithm is based on the concept of involutive monomial division which restricts the conventional division in a certain…
According to V.P.Potapov, a classical interpolation problem can be reformulated in terms of a so-called Fundamental Matrix Inequality (FMI). To show that every solution of the FMI satisfies the interpolation problem, we usualy have to…
Many random combinatorial objects have a component structure whose joint distribution is equal to that of a process of mutually independent random variables, conditioned on the value of a weighted sum of the variables. It is interesting to…
We introduce the sequence of generalized Gon\v{c}arov polynomials, which is a basis for the solutions to the Gon\v{c}arov interpolation problem with respect to a delta operator. Explicitly, a generalized Gon\v{c}arov basis is a sequence…
Classical orthogonal polynomials have widespread applications including in numerical integration, solving differential equations, and interpolation. Changing basis between classical orthogonal polynomials can affect the convergence,…
In this paper, we consider the particular case of the general rational Hermite interpolation problem where only the value of the function is interpolated at some points, and where the function and its first derivatives agree at the origin.…
An interpolation-based decoding scheme for interleaved subspace codes is presented. The scheme can be used as a (not necessarily polynomial-time) list decoder as well as a probabilistic unique decoder. Both interpretations allow to decode…
Consider a sparse multivariate polynomial f with integer coefficients. Assume that f is represented as a "modular black box polynomial", e.g. via an algorithm to evaluate f at arbitrary integer points, modulo arbitrary positive integers.…
In this article we first compare the set of elements in the socle of an ideal of a polynomial algebra $K[x_1,\ldots,x_d]$ over a field $K$ that are not in the ideal itself and Macaulay's inverse systems of such polynomial algebras in a…
When a matrix A with n columns is known to be well approximated by a linear combination of basis matrices B_1,..., B_p, we can apply A to a random vector and solve a linear system to recover this linear combination. The same technique can…
Sparse interpolation} refers to the exact recovery of a function as a short linear combination of basis functions from a limited number of evaluations. For multivariate functions, the case of the monomial basis is well studied, as is now…