中文
相关论文

相关论文: Note on the location of zeros of polynomials

200 篇论文

It is well known that the zeros of orthogonal polynomials interlace. In this paper we study the case of multiple orthogonal polynomials. We recall known results and some recursion relations for multiple orthogonal polynomials. Our main…

经典分析与常微分方程 · 数学 2013-10-04 Maciej Haneczok , Walter Van Assche

We show that with high probability the number of real zeroes of a random polynomial is bounded by the number of vertices on its Newton-Hadamard polygon times the cube of the logarithm of the polynomial degree. A similar estimate holds for…

概率论 · 数学 2016-01-20 Ken Söze

We give sufficient conditions under which a polyanalytic polynomial of degree $n$ has (i) at least one zero, and (ii) finitely many zeros. In the latter case, we prove that the number of zeros is bounded by $n^2$. We then show that for all…

复变函数 · 数学 2024-06-14 Olivier Sète , Jan Zur

We utilize Cauchy's argument principle in combination with the Jacobian of a holomorphic function in several complex variables and the first moment of a ratio of two correlated complex normal random variables to prove explicit formulas for…

概率论 · 数学 2022-01-10 Christopher Corley , Andrew Ledoan , Aaron Yeager

This paper establishes new upper bounds for the right eigenvalues of monic matrix polynomials over the quaternion division algebra. The noncommutative nature of quaternion multiplication presents fundamental challenges in eigenvalue…

复变函数 · 数学 2026-04-17 Ovaisa Jan , Idrees Qasim

We prove a criterion on the possible locations of zeros of type I and type II multiple orthogonal polynomials in terms of normality of degree $1$ Christoffel transforms. We provide another criterion in terms of degree $2$ Christoffel…

经典分析与常微分方程 · 数学 2026-01-22 Rostyslav Kozhan , Marcus Vaktnäs

Let $\mathcal{N} \neq \{0\}$ be a fixed set of integers, closed under multiplication, closed under negation, or containing $\{\pm 1\}$. We prove that any zero of a polynomial in $\mathbf{Z}[X]$ whose coefficients lie in $\mathcal{N}$ can be…

动力系统 · 数学 2024-12-13 David Hokken

We give an upper bound in O(d ^((n+1)/2)) for the number of critical points of a normal random polynomial with degree d and at most n variables. Using the large deviation principle for the spectral value of large random matrices we obtain…

数值分析 · 数学 2010-07-12 Jean-Pierre Dedieu , Gregorio Malajovich

Let L be the zero set of a nonconstant monic polynomial with complex coefficients. In the context of constructive mathematics without countable choice, it may not be possible to construct an element of L. In this paper we introduce a notion…

逻辑 · 数学 2015-10-06 Robert Lubarsky , Fred Richman

We provide upper bounds for the sum of the multiplicities of the non-constant irreducible factors that appear in the canonical decomposition of a polynomial $f(X)\in\mathbb{Z}[X]$, in case all the roots of $f$ lie inside an Apollonius…

In this article, we obtain upper bounds on the number of irreducible factors of some classes of polynomials having integer coefficients, which in particular yield some of the well known irreducibility criteria. For devising our results, we…

数论 · 数学 2026-05-19 Jitender Singh

The paper deals with a complex polynomial $H$ in two variables having - a generic highest homogeneous part (without multiple zero lines), - nonconstant lower terms. In particular, under these conditions the polynomial $H$ has at least two…

代数几何 · 数学 2007-05-23 Alexey Glutsyuk

For a polynomial $u(x)$ in $\mathbb{Z}[x]$ and $r\in\mathbb{Z}$, we consider the orbit of $u(x)$ at $r$, $\mathcal{O}_u(r):=\{u(r),u(u(r)),\ldots\}$. We ask two questions here: (i) what are the polynomials $u$ for which $0\in…

数论 · 数学 2023-05-30 Sayak Sengupta

A fast and weakly stable method for computing the zeros of a particular class of hypergeometric polynomials is presented. The studied hypergeometric polynomials satisfy a higher order differential equation and generalize Laguerre…

数值分析 · 数学 2025-03-27 Nicola Mastronardi , Marc Van Barel , Raf Vandebril , Paul Van Dooren

By applying the Euler--Rayleigh methods to a specific representation of the Jacobi polynomials as hypergeometric functions, we obtain new bounds for their largest zeros. In particular, we derive upper and lower bound for…

经典分析与常微分方程 · 数学 2020-02-10 Geno Nikolov

For any complex polynomial P having all its zeros in the unit disk, we estimate the rate of change of the argument P (z) when the point z runs through the boundary of this disk.

复变函数 · 数学 2021-02-03 V. N. Dubinin

In this paper we introduce the additive analogue of the index of a polynomial over finite fields. We study several problems in the theory of polynomials over finite fields in terms of their additive indices, such as value set sizes, bounds…

数论 · 数学 2021-05-07 Lucas Reis , Qiang Wang

In this paper we investigate the asymptotic distribution of the zeros of polynomials $P_{n}(x)$ satisfying a first order differential-difference equation. We give several examples of orthogonal and non-orthogonal families.

经典分析与常微分方程 · 数学 2013-12-04 Diego Dominici , Walter Van Assche

We present integral representations of solutions to division problems involving matrices of polynomials in several complex variables. We also find estimates of the polynomial degree of the solutions by means of careful degree estimates of…

复变函数 · 数学 2008-06-16 Elin Götmark

We study the explicit formula of Euler numbers and polynomials of higher order

数论 · 数学 2007-05-23 Taekyun Kim
‹ 上一页 1 8 9 10 下一页 ›