2000 character limit reached
On Turán inequality for ultraspherical polynomials
Published 16 Oct 2023 in math.CA | (2310.10459v2)
Abstract: We show that the normalised ultraspherical polynomials, $G_n{(\lambda)}(x)=C_n{(\lambda)}(x)/C_n{(\lambda)}(1)$, satisfy the following stronger version of Tur\'{a}n inequality, $$|x|\theta \left(G_n{(\lambda)}(x)\right)2 -G_{n-1}{(\lambda)}(x)G_{n+1}{(\lambda)}(x) \ge 0 ,\;\;\;|x| \le 1, $$ where $\theta=4/(2-\lambda)$ if $-1/2 <\lambda \le 0$, and $\theta=2/(1+2\lambda)$ if $\lambda \ge 0$. We also provide a similar generalisation of Tur\'{a}n inequalities for some symmetric orthogonal polynomials with a finite or infinite support defined by a three term recurrence.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.