相关论文: On the polynomial moment problem

A polynomial over a ring is called decomposable if it is a composition of two nonlinear polynomials. In this paper, we obtain sharp lower and upper bounds for the number of decomposable polynomials with integer coefficients of fixed degree…

The paper proposes a logical model of combinatorial problems, also it gives an example of a problem of the class NP that can not be solved in polynomial time on the dimension of the problem.

For a set $S$ of quadratic polynomials over a finite field, let $C$ be the (infinite) set of arbitrary compositions of elements in $S$. In this paper we show that there are examples with arbitrarily large $S$ such that every polynomial in…

We consider some discrete $q$-analogues of the classical continuous orthogonal polynomial ensembles. Building on results due to Morozov, Popolitov and Shakirov, we find representations for the moments of the discrete $q$-Hermite and…

This paper is concerned with the inelastic Boltzmann equation without angular cutoff. We work in the spatially homogeneous case. We establish the global-in-time existence of measure-valued solutions under the generic hard potential…

Let $P(x) \in \mathbb{Z}[x]$ be a polynomial. We give an easy and new proof of the fact that the set of primes $p$ such that $p \mid P(n)$, for some $n \in \mathbb{Z}$, is infinite. We also get analog of this result for some special…

In this paper, we consider the problem of representing any polynomial in terms of the degenerate Bernoulli polynomials and more generally of the higher-order degenerate Bernoulli polynomials. We derive explicit formulas with the help of…

We present an algorithm to solve a system of diagonal polynomial equations over finite fields when the number of variables is greater than some fixed polynomial of the number of equations whose degree depends only on the degree of the…

This paper investigates whether or not polynomials that are irreducible over $\mathbb{Q}$ and $\mathbb{Z}$ can remain irreducible under substitution by all quadratic polynomials. It answers this question in the negative in the degree 2 and…

The well-known Heun equation has the form: Q(z)S''(z)+P(z)S'(z)+V(z)S(z)=0 where Q(z) is a cubic complex polynomial, P(z) and V(z) are polynomials of degrees at most 2 and 1 resp. One of the classical problems about the Heun equation is for…

Let $K_f$ be a closed semi-algebraic set in $\dR^d$ such that there exist bounded real polynomials $h_1,{...},h_n$ on $K_f$. It is proved that the moment problem for $K_f$ is solvable provided it is for all sets $K_f\cap C_\lambda$, where…

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…

For a commutative ring $R$, a polynomial $f\in R[x]$ is called separable if $R[x]/f$ is a separable $R$-algebra. We derive formulae for the number of separable polynomials when $R = \mathbb{Z}/n$, extending a result of L. Carlitz. For…

We give upper and lower bounds for the number of solutions of the equation $p(z)\log|z|+q(z)=0$ with polynomials $p$ and $q$.

We show that unless P=NP, there exists no polynomial time (or even pseudo-polynomial time) algorithm that can decide whether a multivariate polynomial of degree four (or higher even degree) is globally convex. This solves a problem that has…

The paper studies the generic complex 1-dimensional polynomial vector fields of the form $iP(z)\frac{\partial}{\partial z}$, where $P$ is a polynomial with real coefficients, under topological orbital equivalence preserving the separatrices…

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…

We present a more general proof that cyclotomic polynomials are irreducible over Q and other number fields that meet certain conditions. The proof provides a new perspective that ties together well-known results, as well as some new…

We reveal a natural algebraic problem whose complexity appears to interpolate between the well-known complexity classes BQP and NP: (*) Decide whether a univariate polynomial with exactly m monomial terms has a p-adic rational root. In…

Let $\mathbb{F}_q[t]$ denote the ring of polynomials over $\mathbb{F}_q$, the finite field of $q$ elements. We prove an estimate for fractional parts of polynomials over $\mathbb{F}_q[t]$ satisfying a certain divisibility condition…