Related papers: Solution of the polynomial moment problem

We use ideas from our previous work to obtain some theorems that will allow us to obtain the integer solution of a quadratic polynomial in two variables that represents a natural number

Let $r$ be a prime power and $q=r^m$. For $0\le i\le m-1$, let $f_i\in \mathbb{F}_r[x]$ be $q$-linearized and $a_i\in \mathbb{F}_q$. Assume that $z\in \mathbb{\bar{F}}_r$ satisfies the equation $\sum_{i=0}^{m-1}a_if_i(z)^{r^i}=0$, where…

We obtain a polynomial-time algorithm that, given input (A, b), where A=(B|N) is an integer mxn matrix, m<n, with nonsingular mxm submatrix B and b is an m-dimensional integer vector, finds a nonnegative integer solution to the system Ax=b…

Using an algebraic method for solving the wave equation in quantum mechanics, we encountered a new class of orthogonal polynomials on the real line. It consists of a four-parameter polynomial with continuous spectrum on the whole real line…

We investigate several families of multiple orthogonal polynomials associated with weights for which the moment generating functions are hypergeometric series with slightly varying parameters. The weights are supported on the unit interval,…

This is a review of ($q$-)hypergeometric orthogonal polynomials and their relation to representation theory of quantum groups, to matrix models, to integrable theory, and to knot theory. We discuss both continuous and discrete orthogonal…

We study the quadratic residue problem known as an NP complete problem by way of the prime number and show that a nondeterministic polynomial process does not belong to the class P because of a random distribution of solutions for the…

We provide an implicit characterization of polynomial time computation in terms of ordinary differential equations: we characterize the class $\operatorname{PTIME}$ of languages computable in polynomial time in terms of differential…

In this paper, we exhibit explicitly a sequence of $2\times2$ matrix valued orthogonal polynomials with respect to a weight $W_{p,n}$, for any pair of real numbers $p$ and $n$ such that $0<p<n$. The entries of these polynomiales are…

The Matrix Torsion Problem (MTP) is: given a square matrix M with rational entries, decide whether two distinct powers of M are equal. It has been shown by Cassaigne and the author that the MTP reduces to the Matrix Power Problem (MPP) in…

We introduce a new family of orthogonal polynomials on the disk that has emerged in the context of wave propagation in layered media. Unlike known examples, the polynomials are orthogonal with respect to a measure all of whose even moments…

Let $k$ be a field of characteristic $\neq 2$. We survey a general method of the field intersection problem of generic polynomials via formal Tschirnhausen transformation. We announce some of our recent results of cubic, quartic and quintic…

We extend Haviland's theorem on the integral representation of positive linear functionals on usual (real multivariate) polynomials to the integral representation of positive linear maps on operator polynomials mapping into the space of…

Solving polynomial equations is a subtask of polynomial optimization. This article introduces systems of such equations and the main approaches for solving them. We discuss critical point equations, algebraic varieties, and solution counts.…

We derive a moment formula for generalized fractional polynomial processes, i.e., for polynomial-preserving Markov processes time-changed by an inverse L\'evy-subordinator. If the time change is inverse $\alpha$-stable, the time-derivative…

The polynomial Pell equation is \[P^2 - D Q^2 = 1\] where $D$ is a given integer polynomial and the solutions $P, Q$ must be integer polynomials. A classical paper of Nathanson \cite{Nat} solved it when $D(x) = x^2 + d$. We show that the…

In this paper we show that a quasi-exactly solvable (normalizable or periodic) one-dimensional Hamiltonian satisfying very mild conditions defines a family of weakly orthogonal polynomials which obey a three-term recursion relation. In…

In 1991, Solomon Golomb discovered a quasilinear solution to Hofstadter's Q-recurrence. In this paper, we construct eventual quasipolynomial solutions of all positive degrees to Hofstadter's recurrence.

The breakthrough paper of Croot, Lev, Pach \cite{CLP} on progression-free sets in $\Z_4^n$ introduced a polynomial method that has generated a wealth of applications, such as Ellenberg and Gijswijt's solutions to the cap set problem…

We present here a probabilistic approach to the generation of new polynomials in two discrete variables. This extends our earlier work on the 'classical' orthogonal polynomials in a previously unexplored direction, resulting in the…