Related papers: A Computer Proof of Turan's Inequality
The orthogonal polynomials $p_n$ satisfy Tur\'an's inequality if $p_n^2(x)-p_{n-1}(x)p_{n+1}(x)\ge 0$ for $n\ge 1$ and for all $x$ in the interval of orthogonality. We give general criteria for orthogonal polynomials to satisfy Tur\'an's…
The polynomials $p_n$ orthogonal on the interval $[-1,1],$ normalized by $p_n(1)=1,$ satisfy Tur\'an's inequality if $p_n^2(x)-p_{n-1}(x)p_{n+1}(x)\ge 0$ for $n\ge 1$ and for all $x$ in the interval of orthogonality. We give a general…
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…
Originally, Tur\'{a}n's inequality states that if $(P_n(x))_{n\in\mathbb{N}_0}$ is the sequence of Legendre polynomials, then $\Delta_n(x):=P_n^2(x)-P_{n+1}(x)P_{n-1}(x)\geq0$ for all $n\in\mathbb{N}$ and $x\in[-1,1]$. Gasper specified the…
The Tur\'{a}n inequalities and the higher order Tur\'{a}n inequalities arise in the study of Maclaurin coefficients of an entire function in the Laguerre-P\'{o}lya class. A real sequence $\{a_{n}\}$ is said to satisfy the Tur\'{a}n…
Let $\overline{p}(n)$ denote the overpartition funtion. Engel showed that for $n\geq2$, $\overline{p}(n)$ satisfied the Tur\'{a}n inequalities, that is, $\overline{p}(n)^2-\overline{p}(n-1)\overline{p}(n+1)>0$ for $n\geq2$. In this paper,…
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) \,…
We use Turan type inequalities to give new non-asymptotic bounds on the extreme zeros of orthogonal polynomials in terms of the coefficients of their three term recurrence. Most of our results deal with symmetric polynomials satisfying the…
We consider the higher order Tur\'an inequality and higher order log-concavity for sequences $\{a_n\}_{n \ge 0}$ such that \[ \frac{a_{n-1}a_{n+1}}{a_n^2} = 1 + \sum_{i=1}^m \frac{r_i(\log n)}{n^{\alpha_i}} + o\left( \frac{1}{n^{\beta}}…
In 1935, P. Tur\'an proved that $$ S_{n,a}(x)= \sum_{j=1}^n{n+a-j\choose n-j} \sin(jx)>0 \quad{(n,a\in\mathbf{N}; 0<x<\pi).} $$ We present various related inequalities. Among others, we show that the refinements $$ S_{2n-1,a}(x)\geq \sin(x)…
This paper deals with both the higher order Tur\'an inequalities and the Laguerre inequalities for quasi-polynomial-like functions -- that are expressions of the form $f(n)=c_l(n)n^l+\cdots+c_d(n)n^d+o(n^d)$, where $d,l\in\mathbb{N}$ and…
Let \mu denote a symmetric probability measure on [-1,1] and let (p_n) be the corresponding orthogonal polynomials normalized such that p_n(1)=1. We prove that the normalized Tur{\'a}n determinant \Delta_n(x)/(1-x^2), where…
Let ${\cal P}_n^c$ denote the set of all algebraic polynomials of degree at most $n$ with complex coefficients. Let $$D^+ := \{z \in \mathbb{C}: |z| \leq 1, \, \, \Im(z) \geq 0\}$$ be the closed upper half-disk of the complex plane. For…
The Tur{\'a}n inequalities and the Laguerre inequalities are closely related to the Laguerre-P\'{o}lya class and the Riemann hypothesis. These inequalities have been extensively studied in the literature. In this paper, we propose a method…
We prove an inequality for Jacobi polynomials that \begin{align} \Delta_n(x):=P_n^{(\alpha_n,\beta_n)}(x)P_n^{(\alpha_{n+1},\beta_{n+1})}(x)- P_{n-1}^{(\alpha_n,\beta_n)}(x)P_{n+1}^{(\alpha_{n+1},\beta_{n+1})}(x)\le 0,\ \forall x\ge 1,…
In this paper we investigate the generalization of the Bessenrodt--Ono inequality by following Gian-Carlo Rota's advice in studying problems in combinatorics and number theory in terms of roots of polynomials. We consider the number of…
In this article we consider mathematical fundamentals of one method for proving inequalities by computer, based on the Remez algorithm. Using the well-known results of undecidability of the existence of zeros of real elementary functions,…
Heim, Neuhauser, and Tr\"oger recently established some inequalities for MacMahon's plane partition function $\mathrm{PL}(n)$ that generalize known results for Euler's partition function $p(n)$. They also conjectured that $\mathrm{PL}(n)$…
We establish some new Tur\'an's type inequalities for orthogonal polynomials defined by a three-term recurrence with monotonic coefficients. As a corollary we deduce asymptotic bounds on the extreme zeros of orthogonal polynomials with…
The $\textbf{P}$ vs. $\textbf{NP}$ problem is an important problem in contemporary mathematics and theoretical computer science. Many proofs have been proposed to this problem. This paper proposes a theoretic proof for $\textbf{P}$ vs.…