arXivDaily arXiv每日学术速递 周一至周五更新
arXiv math/0509468math.CAmath.CO

A Computer Proof of Turan's Inequality

S. Gerhold, M. Kauers

英文摘要:

We show how Turan's inequality $P_n(x)^2-P_{n-1}(x)P_{n+1}(x)\geq 0$ for Legendre polynomials and related inequalities can be proven by means of a computer procedure. The use of this procedure simplifies the daily work with inequalities. For instance, we have found the stronger inequality $|x|P_n(x)^2-P_{n-1}(x)P_{n+1}(x)\geq 0$, $-1\leq x\leq 1$, effortlessly with the aid of our method.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑