Related papers: Solving moment problems by dimensional extension
Consider an $L^1$-continuous functional $\ell$ on the vector space of polynomials of Brownian motion at given times, suppose $\ell $ commutes with the quadratic variation in a natural sense, and consider a finite set of polynomials of…
An effective method for generating linear equations of maximal symmetry in their much general normal form is obtained. In the said normal form, the coefficients of the equation are differential functions of the coefficient of the term of…
Let n be a positive integer, and let R be a finitely presented (but not necessarily finite dimensional) associative algebra over a computable field. We examine algorithmic tests for deciding (1) if every n-dimensional representation of R is…
We consider a generic basic semi-algebraic subset $\mathcal{S}$ of the space of generalized functions, that is a set given by (not necessarily countably many) polynomial constraints. We derive necessary and sufficient conditions for an…
We evaluate the moments of some functions composed with the fractional part of $1/x$. We name them fractional moments. In particular, we obtain expressions for the fractional moments of some trigonometric functions, the Bernoulli…
In this note, we polynomially reduce an instance of the partition problem to a dynamic lot sizing problem, and show that solving the latter problem solves the former problem. By solving the dynamic program formulation of the dynamic lot…
For a class of orthogonal polynomials related to the $q$-Meixner polynomials corresponding to an indeterminate moment problem we give a one-parameter family of orthogonality measures. For these measures we complement the orthogonal…
We show that the set of realizations of a given dimension of a max-plus linear sequence is a finite union of polyhedral sets, which can be computed from any realization of the sequence. This yields an (expensive) algorithm to solve the…
Truncated moment problems in the class of generalized Nevanlinna functions are investigated. General solvability criteria will be established, covering both the even and odd problems, including complete parametrizations of solutions. The…
If a function $f:\mathbb{R}\to\mathbb{R}$ can be represented as the sum of $n$ periodic functions as $f=f_1+\dots+f_n$ with $f(x+\alpha_j)=f(x)$ ($j=1,\dots,n$), then it also satisfies a corresponding $n$-order difference equation…
T. M. Bisgaard proved that the $*$-algebra ${\bf C}[z,\overline{z},1/z\overline{z}]$ has the moment property, that is, each positive linear functional on this $*$-algebra is a moment functional. We generalize this result to polynomials in…
We obtain exact solutions to the class of parabolic partial differential equations of arbitrary dimensionality and with arbitrary potentials. The solutions are presented in a compact-form: as explicit mathematical expressions consisting of…
The present paper is devoted to the {\it local moment problem}, which consists in finding of non-decreasing functions on the real axis having given first $2n+1, \; n\geq 0,$ power moments on the whole axis and also $2m+1$ first power…
We consider the Cauchy problem for homogeneous linear $q$-difference-differential equations with constant coefficients. We characterise convergent, $k$-summable and multisummable formal power series solutions in terms of analytic…
It is well known that the real and imaginary parts of any holomorphic function are harmonic functions of two variables. In this paper we generalize this property to finite-dimensional commutative algebras. We prove that if some basis of a…
Using increasing sequences of real numbers, we generalize the idea of formal moment differentiation first introduced by W. Balser and M. Yoshino. Slight departure from the concept of Gevrey sequences enables us to include a wide variety of…
The Moment/Sum-of-squares hierarchy provides a way to compute the global minimizers of polynomial optimization problems (POP), at the cost of solving a sequence of increasingly large semidefinite programs (SDPs). We consider large-scale…
Moment problems and orthogonal polynomials, both meant in a single real variable, belong to the oldest problems in Classical Analysis. They have been developing for over a century in two parallel, mostly independent streams. During the last…
In this paper we study the set of rational solutions of equations defined by power sums symmetric polynomials with coefficients in a finite field. We do this by means of applying a methodology which relies on the study of the geometry of…
Given a compact parameter set $Y\subset R^p$, we consider polynomial optimization problems $(P_y$) on $R^n$ whose description depends on the parameter $y\inY$. We assume that one can compute all moments of some probability measure $\phi$ on…