相关论文: Multiplicity of zeros and discrete orthogonal poly…
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…
An open problem about two new families of orthogonal polynomials was posed by Alhaidari. Here we will identify one of them as Wilson polynomials. The other family seems to be new but we show that they are discrete orthogonal polynomials on…
It is known that the weight (that is, the number of nonzero coefficients) of a univariate polynomial over a field of characteristic zero is larger than the multiplicity of any of its nonzero roots. We extend this result to an appropriate…
We investigate the zeros of polynomial solutions to the differential-difference equation \[ P_{n+1}(x)=A_{n}(x)P_{n}^{\prime}(x)+B_{n}(x)P_{n}(x), n=0,1,... \] where $A_{n}$ and $B_{n}$ are polynomials of degree at most 2 and 1…
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…
In this article, we consider the singularity of an arbitrary homogeneous polynomial with complex coefficients $f(x_0,\dots,x_n)$ at the origin of $\mathbb C^{n+1}$, via the study of the monodromy characteristic polynomials $\Delta_l(t)$,…
The interplay among the time-evolution of the coefficients and the zeros of a generic time-dependent (monic) polynomial provides a convenient tool to identify certain classes of solvable dynamical systems. Recently this tool has been…
Given a polynomial system f associated with a simple multiple zero x of multiplicity {\mu}, we give a computable lower bound on the minimal distance between the simple multiple zero x and other zeros of f. If x is only given with limited…
We obtain new bounds of exponential sums modulo a prime $p$ with sparse polynomials $a_0x^{n_0} + \cdots + a_{\nu}x^{n_\nu}$. The bounds depend on various greatest common divisors of exponents $n_0, \ldots, n_\nu$ and their differences. In…
In this paper, we give some counting results on integer polynomials of fixed degree and bounded height whose distinct non-zero roots are multiplicatively dependent. These include sharp lower bounds, upper bounds and asymptotic formulas for…
We estimate the number of zeros of a polynomial in $\mathbb{C}[z]$ within any small circular disc centered on the unit circle, which improves and comprehensively extends a result established by Borwein, Erd{\'e}lyi, and Littmann~\cite{BE1}…
In this article we study the limiting empirical measure of zeros of higher derivatives for sequences of random polynomials. We show that these measures agree with the limiting empirical measure of zeros of corresponding random polynomials.…
Let K be F_q((T)), or more generally any field of characteristic p equipped with a valuation having a finite residue field of q elements. Then a polynomial f(x) in K[x] having k+1 nonzero coefficients has at most q^k distinct zeros in K. We…
We give an upper bound on the topological complexity of varieties $\mathcal{V}$ obtained as complements in $\mathbb{C}^m$ of the zero locus of a polynomial. As an application, we determine the topological complexity of unordered…
We establish the asymptotic zero distribution for polynomials generated by a four-term recurrence relation with varying recurrence coefficients having a particular limiting behavior. The proof is based on ratio asymptotics for these…
Expansive polynomials (whose roots are greater than 1 in modulus) often arise in dynamical systems and other computational problems. This paper examines the expansivity gap (the gap between 1 and the smallest modulus of the roots) of these…
Let $\mu$ be a probability measure with an infinite compact support on $\mathbb{R}$. Let us further assume that $(F_n)_{n=1}^\infty$ is a sequence of orthogonal polynomials for $\mu$ where $(f_n)_{n=1}^\infty$ is a sequence of nonlinear…
We examine the maximal number of zeros a polynomial of degree at most n with constrained coefficients may have at 1. Our results are essentially sharp and extend earlier results of this variety. An interesting connection to certain…
A zero-dimensional polynomial ideal may have a lot of complex zeros. But sometimes, only some of them are needed. In this paper, for a zero-dimensional ideal $I$, we study its complex zeros that locate in another variety $\textbf{V}(J)$…
We introduce different notions of polynomial convexity with bounds on degrees of polynomials in $\mathbb C^n$. We provide some examples in higher dimensions and show necessary and sufficient conditions for polynomial convexity with degree…