Related papers: A Computer Proof of Turan's Inequality
Erd\H{o}s and Tur\'an proved a classical inequality on the distribution of roots for a complex polynomial in 1950, depicting the fundamental interplay between the size of the coefficients of a polynomial and the distribution of its roots on…
In the $1970$s, Nicolas proved that the partition function $p(n)$ is log-concave for $ n > 25$. In \cite{HNT21}, a precise conjecture on the log-concavity for the plane partition function $\func{pp}(n)$ for $n >11$ was stated. This was…
In this article we consider a method for proving a class of analytical inequalities via minimax rational approximations. All numerical calculations in this paper are given by Maple computer program.
Nicolas and DeSalvo and Pak proved that the partition function $p(n)$ is log concave for $n \geq 25$. Chen, Jia and Wang proved that $p(n)$ satisfies the third order Tur\'{a}n inequality, and that the associated degree 3 Jensen polynomials…
In this paper, we establish some inequalities for rational functions with prescribed poles having s-fold zeros at origin and also show that it implies some inequalities for polynomials and their polar derivatives.
In this paper, we prove Newton-Maclaurin type inequalities for functions obtained by linear combination of two neighboring primary symmetry functions, which is a generalization of the classical Newton-Maclaurin inequality.
It is known that inequality $|z^n-1|\geq|z-1|$ holds on the circle $|z-1/2|= 1/2$, where $n$ is a positive integer. We prove that in fact $n$ can be real number not less then 1. We also prove following inequality as a lemma: $cos^nx\lt…
In this paper some Tur\'an type inequalities for the general Bessel function, monotonicity and bounds for its logarithmic derivative are derived. Moreover we find the series representation and the relative extrema of the Tur\'anian of…
For any positive integer $n$ and variables $a$ and $x$ we define the generalized Legendre polynomial $P_n(a,x)=\sum_{k=0}^n\b ak\b{-1-a}k(\frac{1-x}2)^k$. Let $p$ be an odd prime. In the paper we prove many congruences modulo $p^2$ related…
Bessenrodt and Ono, Chen, Wang and Jia, DeSalvo and Pak were the first to discover the log-subadditivity, log-concavity, and the third-order Tur\'{a}n inequality of partition function, respectively. Many other important partition statistics…
In the early 1980s, Selman's seminal work on positive Turing reductions showed that positive Turing reduction to NP yields no greater computational power than NP itself. Thus, positive Turing and Turing reducibility to NP differ sharply…
In this article we consider a method of proving a class of inequalities of the form (1). The method is based on the precise approximations of the sine and cosine functions by Maclaurin polynomials of given order. By using this method we…
The classical Erd\H{o}s-Tur\'an inequality on the distribution of roots for complex polynomials can be equivalently stated in a potential theoretic formulation, that is, if the logarithmic potential generated by a probability measure on the…
For rational functions, we use simple but elegant techniques to strengthen generalizations of certain results which extend some widely known polynomial inequalities of Erd\"os-Lax and Tur\'an to rational functions R. In return these…
The function $ \tan(\pi x / 2) / (\pi x / 2) $ is expanded into a Laurent series of $ 1 - x^2 $, where the coefficients are given explicitly as combinations of zeta function of even integers. This is used to achieve a sequence of upper and…
Inspired by the proof of the Bertrand postulate given by P. Erd\H{o}S, we carefully examine and solve one less usual inequality in positive integers which could help to find an arithmetically pure proof that for every positive integer…
The following theorem is proved. {\bf Theorem.} {\it Let $P(x) = \sum_{k=0}^{2n} a_k x^k$ be a polynomial with positive coefficients. If the inequalities $\frac{a_{2k+1}^2}{a_{2k}a_{2k+ 2}} < \frac{1}{cos^2(\frac{\pi}{n+2})} $ hold for all…
It is common practice to compare the computational power of different models of computation. For example, the recursive functions are strictly more powerful than the primitive recursive functions, because the latter are a proper subset of…
In this article, we prove that the least energy nodal solutions to Lane-Emden equation $-{\Delta}u = |u|^{p-2}u$ with zero Dirichlet boundary conditions on a square are odd with respect to one diagonal and even with respect to the other one…
Motivated by some applications in applied mathematics, biology, chemistry, physics and engineering sciences, new tight Tur\'an type inequalities for modified Bessel functions of the first and second kind are deduced. These inequalities…