Related papers: A Computer Proof of Turan's Inequality

A new inequality, $(x)^{p}+(1-x)^{\frac{1}{p}}\leq1$ for $p \geq 1$ and $\frac{1}{2} \geq x \geq 0$ is found and proved. The inequality looks elegant as it integrates two number pairs ($x$ and $1-x$, $p$ and $\frac{1}{p}$) whose summation…

Motivated by a partition inequality of Bessenrodt and Ono, we obtain analogous inequalities for $k$-colored partition functions $p_{-k}(n)$ for all $k\geq2$. This enables us to extend the $k$-colored partition function multiplicatively to a…

Let $\{Q_{n}(x)\}$ be a system of integral Legendre polynomials of degree exactly n,and let $\{P_{n}(x)\}$ be polar polynomials primitives of integral Legendre polynomials. We derive some identities and relations and extremal problems and…

Checking two probabilistic automata for equivalence has been shown to be a key problem for efficiently establishing various behavioural and anonymity properties of probabilistic systems. In recent experiments a randomised equivalence test…

We prove that for any Borel probability measure $\mu$ on $\mathbb R^n$ there exists a set $X\subset \mathbb R^n$ of $n+1$ points such that any $n$-variate quadratic polynomial $P$ that is nonnegative on $X$ (i.e. $P(x)\geq 0$, for every $x…

In this paper, we introduce and prove the generalizations of Radon inequality. The proofs in the paper unify and are simpler than those in former work. Meanwhile, we also find mathematical equivalences among the Bernoulli inequality, the…

The partition function $p(n)$ and many of its related restricted partition functions have recently been shown independently to satisfy log-concavity: $p(n)^2 \geq p(n-1)p(n+1)$ for $n\geq 26$, and satisfy the inequality: $p(n)p(m) \geq…

The classical inequality of Bohr concerning Taylor coeficients of bounded holomorphic functions on the unit disk, has proved to be of significance in answering in the negative the conjecture that if the non-unital von Neumann inequality…

In this paper we deduce some tight Tur\'an type inequalities for Tricomi confluent hypergeometric functions of the second kind, which in some cases improve the existing results in the literature. We also give alternative proofs for some…

We give an alternative, simple method to prove isoperimetric inequalities over the hypercube. In particular, we show: 1. An elementary proof of classical isoperimetric inequalities of Talagrand, as well as a stronger isoperimetric result…

Let $(a_n), (b_n)$ be linear recursive sequences of integers with characteristic polynomials $A(X),B(X)\in \mathbb{Z}[X]$ respectively. Assume that $A(X)$ has a dominating and simple real root $\alpha$, while $B(X)$ has a pair of conjugate…

For the principal eigenvalue of discrete weighted $p$-Laplacian on the set of nonnegative integers, the convergence of an approximation procedure and the inverse iteration is proved. Meanwhile, in the proof of the convergence, the…

We give a very concise proof of Ornstein's $L^1$ non-inequality for first- and second-order operators in two dimensions. The proof just needs a two-dimensional laminate supported on three points.

Bell's theorem is a fundamental result in quantum mechanics: it discriminates between quantum mechanics and all theories where probabilities in measurement results arise from the ignorance of pre-existing local properties. We give an…

Let $p(n)$ denote the partition function. DeSalvo and Pak proved that $\frac{p(n-1)}{p(n)}\left(1+\frac{1}{n}\right)> \frac{p(n)}{p(n+1)}$ for $n\geq 2$, as conjectured by Chen. Moreover, they conjectured that a sharper inequality…

We study possible formulations of algebraic propositional proof systems operating with noncommutative formulas. We observe that a simple formulation gives rise to systems at least as strong as Frege---yielding a semantic way to define a…

Newton's inequalities $c_n^2 \ge c_{n-1}c_{n+1}$ are shown to hold for the normalized coefficients $c_n$ of the characteristic polynomial of any $M$- or inverse $M$-matrix. They are derived by establishing first an auxiliary set of…

Lucas' theorem describes how to reduce a binomial coefficient $\binom{a}{b}$ modulo $p$ by breaking off the least significant digits of $a$ and $b$ in base $p$. We characterize the pairs of these digits for which Lucas' theorem holds modulo…

In our effort to find an arithmetically pure proof of the Bertrand postulate, we investigate and solve (using only elementary arithmetical methods) another less usual inequality in positive integers inspired by the classical proof of the…

Permutation resemblance measures the distance of a function from being a permutation. Here we show how to determine the permutation resemblance through linear integer programming techniques. We also present an algorithm for constructing…