Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
157 tokens/sec
GPT-4o
8 tokens/sec
Gemini 2.5 Pro Pro
46 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

Asymptotic Distribution of the Zeros of recursively defined Non-Orthogonal Polynomials (2107.05013v1)

Published 11 Jul 2021 in math.CA and math.CO

Abstract: We study the zero distribution of non-orthogonal polynomials attached to $g(n)=s(n)=n2$: \begin{equation*} Q_ng(x)= x \sum_{k=1}n g(k) \, Q_{n-k}g(x), \quad Q_0g(x):=1. \end{equation*} It is known that the case $g=id$ involves Chebyshev polynomials of the second kind. The zeros of $Q_ns(x)$ are real, simple, and are located in $(-6\sqrt{3},0]$. Let $N_n(a,b)$ be the number of zeros between $-6 \sqrt{3} \leq a < b \leq 0$. Then we determine a density function $v(x)$, such that \begin{equation*} \lim_{n \rightarrow \infty} \frac{N_n(a,b)}{n} = \int_ab v(x) \,\, \mathrm{d}x. \end{equation*} The polynomials $Q_ns(x)$ satisfy a four-term recursion. We present in detail an analysis of the fundamental roots and give an answer to an open question on recent work by Adams and Tran--Zumba. We extend a method proposed by Freud for orthogonal polynomials to more general systems of polynomials. We determine the underlying moments and density function for the zero distribution.

Summary

We haven't generated a summary for this paper yet.