中文
相关论文

相关论文: On the polynomial moment problem

200 篇论文

Let $K$ be an algebrically closed field and let $n\geq 1$. If $P\in K[X]=K[X_1,\ldots,X_n]$, $P\neq 0$, we denote by $I(P)$ the support of $P$, which is the finite subset of $\mathbb N^n$ such that $P=\sum_{i\in I(P)}a_iX^i$ with $a_i\in…

交换代数 · 数学 2010-08-31 Constantin-Nicolae Beli

This paper studies the polynomial optimization problem whose feasible set is a union of several basic closed semialgebraic sets. We propose a unified hierarchy of Moment-SOS relaxations to solve it globally. Under some assumptions, we prove…

最优化与控制 · 数学 2024-05-21 Jiawang Nie , Linghao Zhang

In this note we give a survey about polynomials whose moments are multiples of super Catalan numbers and explore two different kinds of q-analogues.

组合数学 · 数学 2014-10-23 Johann Cigler

We prove that arithmetic is interpretable in any indecomposable polynomial ring (in any set of variables), and in addition we provide an alternative uniform proof of undecidability for all members in this class of rings.

逻辑 · 数学 2023-09-28 Marco Barone , Nicolás Caro-Montoya , Eudes Naziazeno

Let $\mathcal{F}_n$ be the set of unitary polynomials of degree $n \ge 2$ that have their roots in $\mathbb{Z}^*$. We note $$ Q(x) := x^n+a_{1}x^{n-1}+\dots+a_{n}. $$ We show that any two fixed consecutive coefficients $(a_{j},a_{j+1})$ ($j…

数论 · 数学 2019-11-04 Patrick Letendre

For a prime $p$ and an integer $x$, the $p$-adic valuation of $x$ is denoted by $\nu_{p}(x)$. For a polynomial $Q$ with integer coefficients, the sequence of valuations $\nu_{p}(Q(n))$ is shown to be either periodic or unbounded. The first…

数论 · 数学 2017-08-15 Luis A. Medina , Victor H. Moll , Eric Rowland

A time-dependent monic polynomial in the z variable with N distinct roots such that exactly one root has multiplicity m>=2 is considered. For k=1,2, the k-th derivatives of the N roots are expressed in terms of the derivatives of order j<=…

数学物理 · 物理学 2019-10-23 Oksana Bihun

In this paper we discuss a couple of observations related to polynomial convexity. More precisely, (i) We observe that the union of finitely many disjoint closed balls with centres in $\cup_{\theta\in[0,\pi/2]}e^{i\theta}V$ is polynomially…

复变函数 · 数学 2019-09-11 Sushil Gorai

The existence of sufficiently many finite order meromorphic solutions of a differential equation, or difference equation, or differential-difference equation, appears to be a good indicator of integrability. In this paper, we investigate…

经典分析与常微分方程 · 数学 2018-08-14 Li-Hao Wu , Ran-Ran Zhang , Zhi-Bo Huang

We consider polynomial equations, or systems of polynomial equations, with integer coefficients, modulo prime numbers $p$. We offer an elementary approach based on a counting method. The outcome is a weak form of the Lang-Weil lower bound…

数论 · 数学 2023-01-10 Arnaud Bodin , Pierre Dèbes , Salah Najib

We consider the set of monic irreducible polynomials $P$ over a finite field $\mathbb{F}_q$ such that the multiplicative order modulo $P$ of some a in $\mathbb{F}_q(T)$ is divisible by a fixed positive integer $d$. Call $R_q(a,d)$ this set.…

数论 · 数学 2025-10-21 Joaquim Cera Da Conceição

Most integers are composite and most univariate polynomials over a finite field are reducible. The Prime Number Theorem and a classical result of Gau{\ss} count the remaining ones, approximately and exactly. For polynomials in two or more…

交换代数 · 数学 2014-07-14 Joachim von zur Gathen , Konstantin Ziegler

Let $g(x)$ be a fixed non-constant complex polynomial. It was conjectured by Schinzel that if $g(h(x))$ has boundedly many terms, then $h(x)\in \C[x]$ must also have boundedly many terms. Solving an older conjecture raised by R\'enyi and by…

数论 · 数学 2015-05-13 Umberto Zannier

Three $q$-versions of Lommel polynomials are studied. Included are explicit representations, recurrences, continued fractions, and connections to associated Askey--Wilson polynomials. Combinatorial results are emphasized, including a…

组合数学 · 数学 2021-11-01 Jang Soo Kim , Dennis Stanton

Starting from the moment sequences of classical orthogonal polynomials we derive the orthogonality purely algebraically. We consider also the moments of ($q=1$) classical orthogonal polynomials, and study those cases in which the…

经典分析与常微分方程 · 数学 2022-01-11 Ira M. Gessel , Jiang Zeng

We give an efficient algorithm to enumerate all sets of $r\ge 1$ quadratic polynomials over a finite field, which remain irreducible under iterations and compositions.

For all natural numbers $N$ and prime numbers $p$, we find a knot $K$ whose skein polynomial $P_K(a,z)$ evaluated at $z=N$ has trivial reduction modulo $p$. An interesting consequence of our construction is that all polynomials $P_K(a,N)$…

几何拓扑 · 数学 2022-05-16 Sebastian Baader

We establish necessary and sufficient conditions for a quadratic polynomial to be irreducible in the ring $Z[[x]]$ of formal power series with integer coefficients. For $n,m\ge 1$ and $p$ prime, we show that $p^n+p^m\beta x+\alpha x^2$ is…

交换代数 · 数学 2023-10-24 Daniel Birmajer , Juan Gil , Michael Weiner

Complex moment sequences are exactly those which admit positive definite extensions on the integer lattice points of the upper diagonal half-plane. Here we prove that the aforesaid extension is unique provided the complex moment sequence is…

泛函分析 · 数学 2018-03-09 D. Cichoń , J. Stochel. F. H. Szafraniec

Over the last years the vertex enumeration problem of polyhedra has seen a revival in the study of metabolic networks, which increased the demand for efficient vertex enumeration algorithms for high-dimensional polyhedra given by…

计算几何 · 计算机科学 2016-07-12 Arne C. Reimers , Leen Stougie