Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 2107.05013

Asymptotic Distribution of the Zeros of recursively defined Non-Orthogonal Polynomials

Bernhard Heim·Markus Neuhauser
View original source ↗Read source document ↗Export metadata ↓

Abstract

We study the zero distribution of non-orthogonal polynomials attached to $g(n)=s(n)=n^2$: \begin{equation*} Q_n^g(x)= x \sum_{k=1}^n g(k) \, Q_{n-k}^g(x), \quad Q_0^g(x):=1. \end{equation*} It is known that the case $g=id$ involves Chebyshev polynomials of the second kind. The zeros of $Q_n^s(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_a^b v(x) \,\, \mathrm{d}x. \end{equation*} The polynomials $Q_n^s(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.

Explore related subjects

math.CAmath.CO

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Bernhard Heim, Markus Neuhauser. 2021-07-11. Asymptotic Distribution of the Zeros of recursively defined Non-Orthogonal Polynomials. https://arxiv.org/abs/2107.05013

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

On the prime field spherical restriction conjecture in four dimensions: breaking the Stein-Tomas exponent and applications

Let $p$ be an odd prime. We prove the extension estimate $R_{S_j}^*(2\to r)\lesssim_r 1$ for every nonzero-radius sphere $S_j\subseteq\mathbb{F}_p^4$ and every $r\geq \, 34/11$, uniformly in $p$ and $j$. This improves the Stein--Tomas exponent $10/3$ established by Iosevich and Koh (2008). We also formulate a localized spherical restriction/extension conjecture that predicts the sharp dependence of the restriction norm on the size of the physical support. This conjecture implies the spherical extension estimates $R_{S_j}^*(2\to r)\lesssim_r 1$ for every $r>3$, and yields almost-every-pin distance estimates at the conjectured Erdős--Falconer exponent in four dimensions, up to an arbitrarily small power loss in the set-size hypothesis. Using the same method, we improve the bounds supplied by Fourier decay and Plancherel at intermediate support scales and derive new almost-every-pin distance estimates in $\mathbb{F}_p^4$.

math.CA↗
arXiv2026

Dimension-free estimates for discrete maximal functions over cubes in $\mathbb Z^d$

In this short note, we establish dimension-free $\ell^p(\mathbb Z^d)$ bounds, for all $p\in(1,\infty]$, for the discrete Hardy--Littlewood maximal functions associated with cubes in $\mathbb Z^d$, answering a question that had been open for a while. The key idea is to prove dimension-free bounds for the $\ell^p(\mathbb Z^d)$ norms of the differences of the corresponding averages. This follows from an ad hoc interpretation of the associated discrete multipliers as a special continuous family of multipliers to which basic fractional integration and complex interpolation can be applied. The same method also yields an elementary proof of Bourgain's dimension-free $L^p(\mathbb R^d)$ bounds for the Hardy--Littlewood maximal function associated with cubes in $\mathbb R^d$.

math.CA↗
arXiv2026

Establishing the Polynomial Wolff Axioms for $δ$-Separated $δ$-Tubes With #o-minimality

We establish the full version of a conjecture of Guth and Zahl, giving a lower bound for the volume of a semialgebraic set that has a large intersection with a collection of $δ$-separated $δ$-tubes. Our proof uses o-minimal methods to simplify the proof of Katz and Rogers, who proved the conjecture up to a small factor. We also establish that the constants depend polynomially on the complexity of the semialgebraic set, and more generally in the #o-minimal setting.

math.CA↗