Related papers: Real Zero Polynomials and A. Horn's Problem
We study the stratification of the space of monic polynomials with real coefficients according to the number and multiplicities of real zeros. In the first part, for each of these strata we provide a purely combinatorial chain complex…
We attempt to get a polynomial solution to the inverse problem, that is, to determine the form of the mechanical Hamiltonian when given the energy spectrum and transition dipole moment matrix. Our approach is to determine the potential in…
We study algorithms for approximating the permanent of a random matrix when the entries are slightly biased away from zero. This question is motivated by the goal of understanding the classical complexity of linear optics and \emph{boson…
We prove that a bivariate polynomial f with exactly t non-zero terms, restricted to a real line {y=ax+b}, either has at most 6t-4 zeroes or vanishes over the whole line. As a consequence, we derive an alternative algorithm to decide whether…
In the space of all entire functions it is solved the problem of interpolation taking into account multiplicities by sums of the series of exponentials with the exponents from a given set. It is found a criterion of solubility of the…
Let $E = L_p, \; 1<p\leq 2,$ and $A : E \to E^*$ be a bounded monotone map such that $0 \in R(A)$. In this paper, we introduce and study an algorithm for approximating zeros of $A$. Furthermore, we study the application of this algorithm to…
It is known that polynomials over quaternions may have spherical zeros and isolated left and right zeros. These zeros along with appropriately defined multiplicities form the zero structure of a polynomial. In this paper, we equivalently…
A new effective solution to the problem of Hermite $G^1$ interpolation with a clothoid curve is here proposed, that is a clothoid that interpolates two given points in a plane with assigned unit tangent vectors. The interpolation problem is…
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…
We present fully polynomial approximation schemes for a broad class of Holant problems with complex edge weights, which we call Holant polynomials. We transform these problems into partition functions of abstract combinatorial structures…
The decomposition of polynomials of one vector variable into irreducible modules for the orthogonal group is a crucial result in harmonic analysis which makes use of the Howe duality theorem and leads to the study of spherical harmonics.…
Theory interpolation has found several successful applications in model checking. We present a novel method for computing interpolants for ground formulas in the theory of equality. The method produces interpolants from colored congruence…
We consider the disjoint bilinear programming problem in which one of the disjoint subsets has the structure of an acute-angled polytope. An optimality criterion for such a problem is formulated and proved, and based on this, a polynomial…
This work aims to accelerate the convergence of proximal gradient methods used to solve regularized linear inverse problems. This is achieved by designing a polynomial-based preconditioner that targets the eigenvalue spectrum of the normal…
In this paper we give a complete solution of the following "polynomial moment problem" which arose about 10 years ago in connection with Poincare's center-focus problem. For a given polynomial P(z) to describe polynomials Q(z) orthogonal to…
Prony's method, in its various concrete algorithmic realizations, is concerned with the reconstruction of a sparse exponential sum from integer samples. In several variables, the reconstruction is based on finding the variety for a zero…
The problem of biclustering consists of the simultaneous clustering of rows and columns of a matrix such that each of the submatrices induced by a pair of row and column clusters is as uniform as possible. In this paper we approximate the…
Given a polynomial ring $C$ over a field and proper ideals $I$ and $J$ whose generating sets involve disjoint variables, we determine how to embed the associated primes of each power of $I+J$ into a collection of primes described in terms…
We introduce an interpolation--regression operator for polynomial approximation on the unit sphere $\mathbb{S}^2$ from discrete samples. The approximant is a spherical polynomial of degree $r$ which interpolates the data on a prescribed…
The {\em line sum optimization problem} asks for a $(0,1)$-matrix minimizing the sum of given functions evaluated at its row and column sums. We show that the {\em uniform} problem, with identical row functions and identical column…