中文
相关论文

相关论文: On the polynomial moment problem

200 篇论文

In this paper, various polynomial representations of strange classical Lie superalgebras are investigated. It turns out that the representations for the algebras of type P are indecomposable, and we obtain the composition series of the…

表示论 · 数学 2010-01-21 Cuiling Luo

For an indeterminate moment problem we denote the orthonormal polynomials by P_n. We study the relation between the growth of the function P(z)=(\sum_{n=0}^\infty|P_n(z)|^2)^{1/2} and summability properties of the sequence (P_n(z)). Under…

经典分析与常微分方程 · 数学 2017-01-30 Christian Berg , Ryszard Szwarc

In this paper, we have characterized the nature and form of solutions of the following non-linear delay-differential equation: $$f^{n}(z)+\sum_{i=1}^{n-1}b_{i}f^{i}(z)+q(z)e^{Q(z)}L(z,f)=P(z),$$ where $b_i\in\mathbb{C}$, $L(z,f)$ be a…

复变函数 · 数学 2021-07-13 Abhijit Banerjee , Tania Biswas

The purpose of this paper is to study a class of ill-posed differential equations. In some settings, these differential equations exhibit uniqueness but not existence, while in others they exhibit existence but not uniqueness. An example of…

经典分析与常微分方程 · 数学 2017-01-04 Brian Street

We complete the complexity classification by degree of minimizing a polynomial over the integer points in a polyhedron in $\mathbb{R}^2$. Previous work shows that optimizing a quadratic polynomial over the integer points in a polyhedral…

最优化与控制 · 数学 2015-05-07 Alberto Del Pia , Robert Hildebrand , Robert Weismantel , Kevin Zemmer

Recently Brownawell and the second author proved a "non-degenerate" case of the (unproved) "Zilber Nullstellensatz" in connexion with "Strong Exponential Closure". Here we treat some significant new cases. In particular these settle…

复变函数 · 数学 2024-09-27 Vincenzo Mantova , David Masser

We construct polynomial solutions modulo $p^s$ of the differential KZ and dynamical equations where $p$ is an odd prime number.

代数几何 · 数学 2023-09-04 Pavel Etingof , Alexander Varchenko

This paper considers the question of P = NP in context of the polynomial time SAT algorithm. It posits proposition dependent on existence of conjectured problem that even where the algorithm is shown to solve SAT in polynomial time it…

计算复杂性 · 计算机科学 2009-11-30 C. Sauerbier

We describe various aspects of the Al-Salam-Carlitz $q$-Charlier polynomials. These include combinatorial descriptions of the moments, the orthogonality relation, and the linearization coefficients.

经典分析与常微分方程 · 数学 2016-09-06 Anne de Médicis , Dennis W. Stanton , Dennis E. White

In this manuscript, we study a special class of correspondences on $\mathbb{P}^{1} \times \mathbb{P}^{1}$ given by a polynomial relation, say $P(z, w)$. We focus on what we call restrictive polynomial correspondence and characterise that it…

综合数学 · 数学 2026-05-08 Bharath Krishna Seshadri , Shrihari Sridharan

We study a limiting case of the Askey-Wilson polynomials when one of the parameters goes to infinity, namely continuous dual q-Hahn polynomials when q > 1. Solutions to the associated indeterminate moment problem by general theory are found…

经典分析与常微分方程 · 数学 2023-01-04 Kerstin Jordaan , Maurice Kenfack Nangho

We show, assuming Schanuel's conjecture, that every irreducible complex polynomial in two variables where both variables appear has infinitely many algebraically independent solutions of the form (z,e^z).

数论 · 数学 2011-01-07 Ayhan Gunaydin , Amador Martin-Pizarro

We study multiple orthogonal polynomials exploiting their explicit determinantal representation in terms of moments. Our reasoning follows that applied to solve the Hermite-Pad\'{e} approximation and interpolation problems. We study also…

可精确求解与可积系统 · 物理学 2026-03-17 Adam Doliwa

We extend the Ax-Katz theorem for a single polynomial from finite fields to the rings Z_m with m composite. This extension not only yields the analogous result, but gives significantly higher divisibility bounds. We conjecture what computer…

计算复杂性 · 计算机科学 2014-08-19 Robert L. Surowka , Kenneth W. Regan

We consider a certain mixed polynomial which is an extended Lens equation $L_{n,m}=\bar z^m-p(z)/q(z)$ with $\text{degree}\, q=n$, $\text{degree}\, p<n$ whose numerator is a mixed polynomial of degree $(n+m;n,m)$. Then we consider its…

代数几何 · 数学 2015-10-21 Mutsuo Oka

Linear differential equations of arbitrary order with polynomial coefficients are considered. Specifically, necessary and sufficient conditions for the existence of polynomial solutions of a given degree are obtained for these equations. An…

数学物理 · 物理学 2011-09-27 H. Azad , A. Laradji , M. T. Mustafa

We consider the question of certifying that a polynomial in ${\mathbb Z}[x]$ or ${\mathbb Q}[x]$ is irreducible. Knowing that a polynomial is irreducible lets us recognise that a quotient ring is actually a field extension (equiv.~that a…

交换代数 · 数学 2020-05-12 John Abbott

We give the sufficient condition on coefficients $a_k$ of an algebraic polynomial $P(z)=\sum_{k=0}^{n}a_kz^k$, $a_n\not=0,$ for the pointwise Bernstein inequality $|P'(z)|\le n|P(z)|$ to be true for all $z\in\overline{\mathbb…

复变函数 · 数学 2021-04-06 Adrian Savchuk

In this paper, we fix a polynomial with complex coefficients and determine the eigenforms for SL2(Z) which can be expressed as the fixed polynomial evaluated at other eigenforms. In particular, we show that when one excludes trivial cases,…

数论 · 数学 2018-10-23 Joseph Richey , Noah Shutty

We consider polynomials with integer coefficients and discuss their factorization properties in Z[[x]], the ring of formal power series over Z. We treat polynomials of arbitrary degree and give sufficient conditions for their reducibility…

交换代数 · 数学 2014-06-20 Daniel Birmajer , Juan B. Gil , Michael D. Weiner