Related papers: On the trigonometric moment problem
In this article we solve four special cases of the truncated Hamburger moment problem (THMP) of degree $2k$ with one or two missing moments in the sequence. As corollaries we obtain, by using appropriate substitutions, the solutions to…
We present a new connection between the classical theory of full and truncated moment problems and the theory of partial differential equations, as follows. For the classical heat equation $\partial_t u = \nu \Delta u$, with initial data…
This article considers the problem of solving a system of $n$ real polynomial equations in $n+1$ variables. We propose an algorithm based on Newton's method and subdivision for this problem. Our algorithm is intended only for nondegenerate…
A classical result due to Bochner characterizes the classical orthogonal polynomial systems as solutions of a second-order eigenvalue equation. We extend Bochner's result by dropping the assumption that the first element of the orthogonal…
We study self-adjoint matrix polynomial equations in a single variable and prove existence of self-adjoint solutions under some assumptions on the leading form. Our main result is that any self-adjoint matrix polynomial equation of odd…
We study the polynomial optimization problem of minimizing a multihomogeneous polynomial over the product of spheres. This polynomial optimization problem models the tensor optimization problem of finding the best rank one approximation of…
We present a method for the solution of polynomial equations. We do not intend to present one more method among several others, because today there are many excellent methods. Our main aim is educational. Here we attempt to present a method…
The low-degree polynomial framework has been highly successful in predicting computational versus statistical gaps for high-dimensional problems in average-case analysis and machine learning. This success has led to the low-degree…
We investigate the generalized moment membership problem for matrices, a formulation equivalent to Skolem's problem for linear recurrence sequences. We show decidability for orthogonal, unitary, and real eigenvalue matrices, and…
We study the theory of equations in one variable over polyhedral semirings. The article revolves around a notion of solution to a polynomial equation over a polyhedral semiring. Our main results are a characterisation of local solutions in…
The uniform probability measure on a convex polytope induces piecewise polynomial densities on its projections. For a fixed combinatorial type of simplicial polytopes, the moments of these measures are rational functions in the vertex…
We consider a spacetime singularity at $t = 0$ arising in a Kasner-type metric that solves the gravitational equations modified by quantum effects of a conformal field theory (CFT). The resulting constraints can be solved efficiently when…
The problem of solving tropical linear systems, a natural problem of tropical mathematics, has already proven to be very interesting from the algorithmic point of view: it is known to be in $NP\cap coNP$ but no polynomial time algorithm is…
Let $\{\mathbb{P}_n\}_{n\ge 0}$ and $\{\mathbb{Q}_n\}_{n\ge 0}$ be two monic polynomial systems in several variables satisfying the linear structure relation $$\mathbb{Q}_n = \mathbb{P}_n + M_n \mathbb{P}_{n-1}, \quad n\ge 1,$$ where $M_n$…
The article studies a generalization of the classical Fermat-Torricelli problem to normed spaces of arbitrary finite dimension. Necessary and sufficient conditions for the uniqueness of the solution of the Fermat-Torricelli problem for any…
The article [14] gives a list of 51 symplectic hypergeometric monodromy groups corresponding to primitive pairs of degree four polynomials, which are products of cyclotomic polynomials, and for which, the absolute value of the leading…
An inhomogeneous Tricomi equation is considered in a strip with a polynomial right-hand side. It is shown that the Dirichlet boundary value problem with polynomial boundary conditions has a polynomial solution. An algorithm for constructing…
The objective of this article is to formalize the definition of NP problems. We construct a mathematical model of discrete problems as independence systems with weighted elements. We introduce two auxiliary sets that characterize the…
We provide sufficient conditions for systems of polynomial equations over general (real or complex) algebras to have a solution. This generalizes known results on quaternions, octonions and matrix algebras. We also generalize the…
Traditionally, the P3P problem is solved by firstly transforming its 3 quadratic equations into a quartic one, then by locating the roots of the resulting quartic equation and verifying whether a root does really correspond to a true…