Papers
Topics
Authors
Recent
Search
2000 character limit reached

Turán inequalities from Chebyshev to Laguerre polynomials

Published 3 Apr 2022 in math.CA and math.NT | (2204.01008v1)

Abstract: Let $g$ and $h$ be real-valued arithmetic functions, positive and normalized. Specific choices within the following general scheme of recursively defined polynomials \begin{equation*} P_n{g,h}(x):= \frac{x}{h(n)} \sum_{k=1}{n} g(k) \, P_{n-k}{g,h}(x), \end{equation*} with initial value $P_{0}{g,h}(x)=1$ encode information about several classical, widely studied polynomials. This includes Chebyshev polynomials of the second kind, associated Laguerre polynomials, and the Nekrasov--Okounkov polynomials. In this paper we prove that for $g(n)=n$ and fixed $h$ we obtain orthogonal polynomial sequences for positive definite functionals. Let $h(n)=ns$ with $0 \leq s \leq 1 $. Then the sequence satisfies Tur\'an inequalities for $x \geq 0$.

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Collections

Sign up for free to add this paper to one or more collections.