Related papers: A Computer Proof of Turan's Inequality

In this short expository article, we describe a mathematical tool called the probabilistic method, and illustrate its elegance and beauty through proving a few well-known results. Particularly, we give an unconventional probabilistic proof…

Inspired by the work of C. Mortici [1] and A. Laforgia et. al [2] we have established some new Tur\'an-type inequalities for k-polygamma function and p-k-polygamma function.

The aim of this paper is to present a new algorithm for proving mixed trigonometric-polynomial inequalities by reducing to polynomial inequalities. Finally, we show the great applicability of this algorithm and as examples, we use it to…

We will find a lower bound on the recognition complexity of the theories that are nontrivial relative to some equivalence relation (this relation may be equality), namely, each of these theories is consistent with the formula, whose sense…

We derive an asymptotic expansion with effective error bound for $u(n)$, counting the number of unimodal sequences of size $n$. We prove that $u(n)$ satisfies the higher order Tur\'{a}n inequalities for $n\geq33$ and that certain second…

We prove that the number $q(n)$ of partitions into distinct parts is log-concave for $n \geq 33$ and satisfies the higher order Tur\'an inequalities for $n\geq 121$ conjectured by Craig and Pun. In doing so, we establish explicit error…

Our main result is that every n-dimensional polytope can be described by at most (2n-1) polynomial inequalities and, moreover, these polynomials can explicitly be constructed. For an n-dimensional pointed polyhedral cone we prove the bound…

For a convex domain $K$ in the complex plane, the well-known general Bernstein-Markov inequality holds asserting that a polynomial $p$ of degree $n$ must have $||p'|| < c(K) n^2 ||p||$. On the other hand for polynomials in general, $||p'||$…

The Delannoy polynomial $D_n(x)$ is defined by $$ D_n(x)=\sum_{k=0}^{n}{n\choose k}{n+k\choose k}x^k. $$ We prove that, if $x$ is an integer and $p$ is a prime not dividing $x(x+1)$, then \begin{align*} \sum_{k=0}^{p-1}(2k+1)D_k(x)^3…

We provide an elementary proof of the left side inequality and improve the right inequality in \bigg[\frac{n!}{x-(x^{-1/n}+\alpha)^{-n}}\bigg]^{\frac{1}{n+1}}&<((-1)^{n-1}\psi^{(n)})^{-1}(x)…

Let $p$ be an odd prime. In the paper, by using the properties of Legendre polynomials we prove some congruences for $\sum_{k=0}^{\frac{p-1}2}\binom{2k}k^2m^{-k}\mod {p^2}$. In particular, we confirm several conjectures of Z.W. Sun. We also…

In this paper certain Tur\'an type inequalities for some Lommel functions of the first kind are deduced. The key tools in our proofs are the infinite product representation for these Lommel functions of the first kind, a classical result of…

In this paper, we study some supercongruences involving the sequence $$ t_n(x)=\sum_{k=0}^n\binom{n}{k}\binom{x}{k}\binom{x+k}{k}2^k $$ and solve some open problems. For any odd prime $p$ and $p$-adic integer $x$, we determine…

In this paper, we prove an inequality regarding the differential polynomial. This improves some recent results.

In this paper we take a probabilistic look at Maclaurin's inequality, which is a refinement of the classical AM-GM inequality. In a natural randomized setting, we obtain limit theorems and show that a reverse inequality holds with high…

Let $A,\;B$ be the positive semidefinite matrices. A matrix version of the famous Powers-St{\o}rmer's inequality $$2Tr(A^\alpha B^{1-\alpha})\geq Tr(A+B-|A-B|),\;\;\;0\leq\alpha\leq 1,$$ was proven by Audenaert et. al. We establish a…

In 1977 Pohst conjectured a certain inequality for $n$ variables and give a computer-assisted proof for $n\leq 10$. We give a proof for all $n$ using a combinatorial argument. This inequality yields a better bound for the regulator in terms…

We give an arithmetical proof of the strong normalization of the $\lambda$-calculus (and also of the $\lambda\mu$-calculus) where the type system is the one of simple types with recursive equations on types. The proof using candidates of…

Let $\Pi_n$ be the class of algebraic polynomials $P$ of degree $n$, all of whose zeros lie on the segment $[-1,1]$. In 1995, S.P. Zhou has proved the following Tur\'{a}n type reverse Markov-Nikol'skii inequality: $\|P'\|_{L_p[-1,1]}>c\,…

The pseudoinverse of a matrix, a generalized notion of the inverse, is of fundamental importance in linear algebra and, thereby, in many different fields. Despite its proven existence, an algorithmic approach is typically necessary to…