Related papers: A note on the complexity of a phaseless polynomial…

We present an exact and complete algorithm to isolate the real solutions of a zero-dimensional bivariate polynomial system. The proposed algorithm constitutes an elimination method which improves upon existing approaches in a number of…

In this paper we study unimodality problems for the independence polynomial of a graph, including unimodality, log-concavity and reality of zeros. We establish recurrence relations and give factorizations of independence polynomials for…

We treat the following "polynomial moment problem": for a complex polynomial P(z) and distinct complex numbers a,b such that P(a)=P(b) to describe polynomials q(z)=Q'(z) orthogonal to all degrees of P(z) on the segment [a,b]. We show that…

If the phase retrieval problem can be solved by a method similar to that of solving a system of linear equations under the context of FFT, the time complexity of computer based phase retrieval algorithm would be reduced. Here I present such…

This work studies phase retrieval for wave fields, aiming to recover the phase of an incoming wave from multi-plane intensity measurements behind different types of linear and nonlinear media. We show that unique phase retrieval can be…

A new family of polynomials, called cumulant polynomial sequence, and its extensions to the multivariate case is introduced relied on a purely symbolic combinatorial method. The coefficients of these polynomials are cumulants, but depending…

In this work, we address the problem of polynomial interpolation of non-pointwise data. More specifically, we assume that our input information comes from measurements obtained on diffuse compact domains. Although the nodal and the diffused…

In this work, the concept of quasi-type Kernel polynomials with respect to a moment functional is introduced. Difference equation satisfied by these polynomials along with the criterion for orthogonality conditions are discussed. The…

In the space of holomorphic functions in a convex domain it is studied the interpolation problem by means of sums of the series of exponentials converging uniformly on all compact sets of the domain. The discrete set of the interpolation…

We prove that if nonlinear complex polynomials of the same degree have orbits with infinite intersection, then the polynomials have a common iterate. We also prove a special case of a conjectured dynamical analogue of the Mordell-Lang…

In this paper, the inverse spectral problem is applied to the integration of a periodic Volterra chain. A generalization of the Lagrange interpolation formula has been made.

Univariate polynomial root-finding is a classical subject, still important for modern computing. Frequently one seeks just the real roots of a polynomial with real coefficients. They can be approximated at a low computational cost if the…

Renormalized homotopy continuation on toric varieties is introduced as a tool for solving sparse systems of polynomial equations, or sparse systems of exponential sums. The cost of continuation depends on a renormalized condition length,…

The modular decomposition is a technique that applies but is not restricted to graphs. The notion of module naturally appears in the proofs of many graph theoretical theorems. Computing the modular decomposition tree is an important…

In this paper, we consider the problem of formal iteration. We construct an area preserving mapping which does not have any square root. This leads to a counterexample to Moser's existence theorem for an interpolation problem. We give…

We develop a formal framework for the behavioral comparison of linear systems across different time domains. We accomplish this by introducing the notion of system interpolation, which determines whether the input-state trajectories of a…

The aim of this short note is to draw attention to a method by which the partition function and marginal probabilities for a certain class of random fields on complete graphs can be computed in polynomial time. This class includes Ising…

An algebraic approach is presented for the valuative interpolation problem, which recovers and generalizes prior characterizations known in the complex analytic setting by the authors. We use the asymptotic Samuel function to give the…

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…

We consider a renewal-like recursion and prove that the solution is polynomially decaying asymptotically under suitable conditions. We prove similar results for the corresponding integral equation. In both cases coefficients and functions…