Related papers: A Computer Proof of Turan's Inequality
A great number of articles widen a known scientific result $P(a)$ (such as: a theorem, an inequality, or a math/physics/chemical etc. proposition or formula) by a simple recurrence procedure and using, in the proof, the proposition $P(a)$…
An analogue of Gross' logarithmic Sobolev inequality for a class of elements of noncommutative two tori is proved.
When a computer algebra system fails to solve an Ordinary Differential Equation, is this a limitation of its implementation, or a genuine computational barrier? Three traditions bear on the question. Modern computer algebra algorithms can…
This paper introduces new notions of asymptotic proofs, PT(polynomial-time)-extensions, PTM(polynomial-time Turing machine)-omega-consistency, etc. on formal theories of arithmetic including PA (Peano Arithmetic). This paper shows that P…
This paper derives an inequality relating the p-norm of a positive 2 x 2 block matrix to the p-norm of the 2 x 2 matrix obtained by replacing each block by its p-norm. The inequality had been known for integer values of p, so the main…
Let $\overline{p}(n)$ denote the overpartition funtion. This paper presents the $2$-$\log$-concavity property of $\overline{p}(n)$ by considering a more general inequality of the following form \begin{equation*} \begin{vmatrix}…
First of all we give some reasons that "natural proofs" built not a barrier to prove P $\not=$ NP using Boolean complexity. Then we investigate the approximation method for its extension to prove super-polynomial lower bounds for the…
In this note we revisit the classical geometric-arithmetic mean inequality and find a formula for the difference of the arithmetic and the geometric means of given $n\in\mathbb N$ nonnegative numbers $x_1,x_2,\dots,x_n$. The formula yields…
Given positive real numbers, we prove two inequalities involving their potential energy and their power sums. We also prove an inequality involving the energy and the discriminant and apply it to deduce a result on totally positive…
The aim of this paper is to establish Tur\'an -type inequality for the Hahn-Exton $q$-Bessel functions. The result is obtained by the use of limit transition.
In this paper, we establish Newton-Maclaurin type inequalities for functions arising from linear combinations of primitively symmetric polynomials. This generalization extends the classical Newton-Maclaurin inequality to a broader class of…
The sequence $A(n)_{n \geq 0}$ of Ap\'ery numbers can be interpolated to $\mathbb{C}$ by an entire function. We give a formula for the Taylor coefficients of this function, centered at the origin, as a $\mathbb{Z}$-linear combination of…
We prove an elementary yet useful inequality bounding the maximal value of certain linear programs. This leads directly to a bound on the martingale difference for arbitrarily dependent random variables, providing a generalization of some…
This article presents a strongly polynomial-time algorithm for the general linear programming problem. This algorithm is an implicit reduction procedure that works as follows. Primal and dual problems are combined into a special system of…
We show that if $f$ is the random completely multiplicative function, the probability that $\sum_{n\le x}\frac{f(n)}{n}$ is positive for every $x$ is at least $1-10^{-45}$, while also strictly smaller than $1$. For large $x$, we prove an…
Yuan's theorem of the alternative is an important theoretical tool in optimization, which provides a checkable certificate for the infeasibility of a strict inequality system involving two homogeneous quadratic functions. In this paper, we…
The well-known Turing machine is an example of a theoretical digital computer, and it was the logical basis of constructing real electronic computers. In the present paper we propose an alternative, namely, by formalising arithmetic…
We prove a certain duality relation for orthogonal polynomials defined on a finite set. The result is used in a direct proof of the equivalence of two different ways of computing the correlation functions of a discrete orthogonal polynomial…
We extend the necessity part of Lucas Lehmer iteration for testing Mersenne prime to all base and uniformly for both generalized Mersenne and Wagstaff numbers(the later correspond to negative base). The role of the quadratic iteration $x…
For each $n=0,1,2,\ldots$, the central trinomial coefficient $T_n$ is the coefficient of $x^n$ in the expansion of $(x^2+x+1)^n$. Let $p>3$ be a prime, and let $n$ be any positive integer. In 2016, the second author conjectured that the…