相关论文: On the polynomial moment problem

We consider Complex Ginzburg-Landau equations with a polynomial nonlinearity in the real line. We use splitting-methods to prove well-posedness for a subset of almost periodic spaces. Specifically, we prove that if the initial condition has…

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$…

Exact solution to many problems in mathematical physics and quantum field theory often can be expressed in terms of an algebraic curve equipped with a meromorphic differential. Typically, the geometry of the curve can be seen most clearly…

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…

Let $\mathbb{F}_q$ denote the finite field of $q$ elements with characteristic $p$. Let $\mathbb{Z}_q$ denote the unramified extension of the $p$-adic integers $\mathbb{Z}_p$ with residue field $\mathbb{F}_q$. In this paper, we investigate…

Classifications of irreducible components of the set of polynomial differential equations with a fixed degree and with at least one center singularity lead to some other new problems on Picard-Lefschetz theory and Brieskorn modules of…

Let $\mathbb R_t[\theta]$ be the ring generated over $\mathbb R$ by $\cos\theta$ and $\sin\theta$, and $\mathbb R_t(\theta)$ be its quotient field. In this paper we study the ways in which an element p of $\mathbb R_t[\theta]$ can be…

Taking the examples of Legendre and Hermite orthogonal polynomials, we show how to interpret the fact that these orthogonal polynomials are moments of other orthogonal polynomials in terms of their associated Riordan arrays. We use these…

If, for a subset S of Z^k, we compare the conditions of being parametrizable (a) by a single k-tuple of polynomials with integer coefficients, (b) by a single k-tuple of integer-valued polynomials and, (c) by finitely many k-tuples of…

For the bi-orthogonal polynomials with the third degree polynomial potential functions, the 3 x 3 matrix Riemann-Hilbert problem is explicitly constructed. The developed approach admits an extension to the bi-orthogonal polynomials with…

Let $(P_n)_n$ and $(Q_n)_n$ be two sequences of monic polynomials linked by a type structure relation such as $$ Q_{n}(x)+r_nQ_{n-1}(x)=P_{n}(x)+s_nP_{n-1}(x)+t_nP_{n-2}(x)\;, $$ where $(r_n)_n$, $(s_n)_n$ and $(t_n)_n$ are sequences of…

Multivariate orthogonal polynomials can be introduced by using a moment functional defined on the linear space of polynomials in several variables with real coefficients. We study the so-called Uvarov and Christoffel modifications obtained…

Let $p$ be a prime. In this paper, we give a complete classification of self-reciprocal polynomials arising from Fibonacci polynomials over $\mathbb{Z}$ and $\mathbb{Z}_p$, where $p=2$ and $p>5$. We also present some partial results when…

The Schinzel hypothesis essentially claims that finitely many irreducible polynomials in one variable over Z simultaneously assume infinitely many prime values unless there is an obvious reason why this is impossible. We prove that under a…

We discuss the polynomial representation for long knots and elaborate on how to obtain them with a bound on degrees of the defining polynomials, for any knot-type.

Answering a question of Haugland, we show that the pooling problem with one pool and a bounded number of inputs can be solved in polynomial time by solving a polynomial number of linear programs of polynomial size. We also give an overview…

In this paper, we study the following complex Schr\"{o}dinger equation with a $q$-difference term: \begin{align}\tag{{\dag}}\label{dagger} f'(z) = a(z)f(qz) + R(z, f(z)), \quad R(z, f(z)) = \frac{P(z, f(z))}{Q(z, f(z))}, \end{align} where…

We study the problem of generating monomials of a polynomial in the context of enumeration complexity. In this setting, the complexity measure is the delay between two solutions and the total time. We present two new algorithms for…

For a degree $n$ polynomial $f$ over the rationals, the elements in the fiber $f^{-1}(a)$ are of degree $n$ over $\mathbb Q$ for most rational values $a$ by Hilbert's irreducibility theorem. Determining the set of exceptional $a$'s without…

In this paper, we introduce a new analogue of Lorentz polynomials based on (p,q)-integers and we call it as (p,q)-Lorentz polynomials. We obtain quantitative estimate in the Voronovskaja's type thoerem and exact orders in simultaneous…