Related papers: A note on the complexity of a phaseless polynomial…
The authors of ``A note on the complexity of a phaseless polynomial interpolation'' have shown that phaseless polynomial interpolation over $\mathbf{Q}$ is possible with $n+2$ points, where $n$ is the upper-bound on the degree of a…
Interpolation theory for complex polynomials is well understood. In the non-commutative quaternionic setting, the polynomials can be evaluated "on the left" and "on the right". If the interpolation problem involves interpolation conditions…
Techniques for the evaluation of complex polynomials with one and two variables are introduced. Polynomials arise in may areas such as control systems, image and signal processing, coding theory, electrical networks, etc., and their…
I show that the power iteration method applied to the phase retrieval problem converges under special conditions. One is given the relative phases between small non-overlapping groups of pixels of a recorded intensity pattern, but no…
We present a variational method for recovering the phase term from the information obtained from phase-shifting methods. First we introduce the new method based on a variational approach and then describe the numerical solution of the…
The usual univariate interpolation problem of finding a monic polynomial f of degree n that interpolates n given values is well understood. This paper studies a variant where f is required to be composite, say, a composition of two…
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 prove by means of elementary methods that phase retrieval of complex polynomials p of degree less than N is possible with 4N-4 phaseless Fourier measurements of p and p'. In addition, we provide an associated algorithm and prove that it…
This paper focuses on phase retrieval from phaseless total-field data in biharmonic scattering problems. We prove that a phased biharmonic wave can be uniquely determined by the modulus of the total biharmonic wave within a nonempty domain.…
We propose an approach to the problem of global reconstruction of an orientation field. The method is based on a geometric model called "bisector line fields", which maps a pair of vector fields to an orientation field, effectively…
In this survey, different aspects of the theory of orthogonal polynomials of one (real or complex) variable are reviewed. Orthogonal polynomials on the unit circle are not discussed.
The Phase Retrieval problem is dealt with for the challenging case where just a single set of (phaseless) radiated field data is available. In particular, even still emulating the solution of crosswords puzzles, we provide decisive…
A class of scalar models with non-polynomial interaction, which naturally admits an analytical resummation of the series of tadpole diagrams is studied in perturbation theory. In particular, we focus on a model containing only one…
We consider space-saving versions of several important operations on univariate polynomials, namely power series inversion and division, division with remainder, multi-point evaluation, and interpolation. Now-classical results show that…
Motivated by a recently introduced HIMMO key distribution scheme, we consider a modification of the noisy polynomial interpolation problem of recovering an unknown polynomial $f(X) \in Z[X]$ from approximate values of the residues of $f(t)$…
We investigate the following question: if a polynomial can be evaluated at rational points by a polynomial-time boolean algorithm, does it have a polynomial-size arithmetic circuit? We argue that this question is certainly difficult.…
The volume of a cyclic polytope can be obtained by forming an iterated integral along a suitable piecewise linear path running through its edges. Different choices of such a path are related by the action of a subgroup of the combinatorial…
We consider quantum interpolation of polynomials. We imagine a quantum computer with black-box access to input/output pairs (x_i, f(x_i)), where f is a degree-d polynomial, and we wish to compute f(0). We give asymptotically tight quantum…
We analyse and compare the complexity of several algorithms for computing modular polynomials. We show that an algorithm relying on floating point evaluation of modular functions and on interpolation, which has received little attention in…
This paper considers the extension of classical Lagrange interpolation in one real or complex variable to "polynomials of one quaternionic variable". To do this we develop some aspects of the theory of such polynomials. We then give a…