Related papers: On the trigonometric moment problem
The main purpose of this paper is to study the NP-complete subset-sum problem, not in the usual context of time-complexity-based classification of the algorithms (exponential/polynomial), but through a new kind of algorithmic classification…
We give an explicit solution of a q-Riemann Hilbert problem which arises in the theory of orthogonal polynomials, prove that it is unique, and deduce several properties. Our new results include the asymptotic behaviour of zeroes in the…
We recall the definition and the properties of a moment sequence and recall that all real sequences that have a finite rank of its Hankel matrix (see definition in the sequel) satisfy a homogeneous linear equation with constant…
We obtain representations of $X_1$ exceptional orthogonal polynomials through determinants of matrices that have certain adjusted moments as entries. We start out directly from the Darboux transformation, allowing for a universal…
In this paper we obtain an algorithm towards solving the two-dimensional moment problem. This algorithm gives the necessary and sufficient conditions for the solvability of the moment problem. It is shown that all solutions of the moment…
In this article the solution of the special problem of the conditional extremum for the conjugate trigonometric polynomials is given. A possibility to apply this result to the problems of optimal stabilization of quasidynamic chaos in…
The aim of the work is to construct new polynomial systems, which are solutions to certain functional equations which generalize the second-order differential equations satisfied by the so called classical orthogonal polynomial families of…
We present an expanded expository account of the $K$-moment problem for polynomial algebras over \(\R^d\), with special emphasis on compact basic closed semialgebraic sets. The central question is to characterize those linear functionals on…
Symmetries occur naturally in CSP or SAT problems and are not very difficult to discover, but using them to prune the search space tends to be very challenging. Indeed, this usually requires finding specific elements in a group of…
The theory of holomorphic functions of several complex variables is applied in proving a multidimensional variant of a theorem involving an exponential boundedness criterion for the classical moment problem. A theorem of Petersen concerning…
A moment problem is presented for a class of signed measures which are termed pseudo-positive. Our main result says that for every pseudo-positive definite functional (subject to some reasonable restrictions) there exists a representing…
Michel proved that for a one-parameter family of elliptic curves over Q(T) with non-constant j(T) that the second moment of the number of solutions modulo p is p^2 + O(p^{3/2}). We show this bound is sharp by studying y^2 = x^3 + Tx^2 + 1.…
The generalisation of continuous orthogonal polynomial ensembles from random matrix theory to the $q$-lattice setting is considered. We take up the task of initiating a systematic study of the corresponding moments of the density from two…
We present a solution to the real multidimensional rational K-moment problem, where K is defined by finitely many polynomial inequalities. More precisely, let S be a finite set of real polynomials in X=(X_1,...,X_n) such that the…
This paper introduces and develops the algebraic framework of moment polynomials, which are polynomial expressions in commuting variables and their formal mixed moments. Their positivity and optimization over probability measures supported…
We give a new framework for proving the existence of low-degree, polynomial approximators for Boolean functions with respect to broad classes of non-product distributions. Our proofs use techniques related to the classical moment problem…
We consider the Moment-SOS hierarchy in polynomial optimization. We first provide a sufficient condition to solve the truncated K-moment problem associated with a given degree-$2n$ pseudo-moment sequence $\phi$ n and a semi-algebraic set $K…
In this prelinimary version of paper, we propose to give a complete solution to the Truncated Multidimensional Trigonometric Moment Problem (TMTMP) from a system and signal processing perspective. In mathematical TMTMPs, people care about…
We consider the explicit relation between two resolvent matrices related to the truncated Hausdorff matrix moment problem (THMM) in the case of an even and odd number of moments. This relation is described with the help of four families of…
This paper studies the saddle point problem of polynomials. We give an algorithm for computing saddle points. It is based on solving Lasserre's hierarchy of semidefinite relaxations. Under some genericity assumptions on defining…