Related papers: A Computer Proof of Turan's Inequality

In this paper the double-sided Talor's approximations are used to obtain generalisations and improvements of some trigonometric inequalities.

Euler's inequality $R\geq 2r$ can be investigated in a novel way by using implicit loci in GeoGebra. Some unavoidable side effects of the implicit locus computation introduce unexpected algebraic curves. By using a mixture of symbolic and…

We consider a sequence of polynomials $\{P_n\}_{n \geq 0}$ satisfying a special $R_{II}$ type recurrence relation where the zeros of $P_n$ are simple and lie on the real line. It turns out that the polynomial $P_n$, for any $n \geq 2$, is…

For a normed linear space $(X,|\cdot|)$ and $p>0$ we characterize all $n$-tuples $(\mu_1,...,\mu_n)\in\mathbb{R}^{n}$ for which the generalized triangle inequality of the second type…

Suppose that we are given an infinite binary sequence which is random for a Bernoulli measure of parameter $p$. By the law of large numbers, the frequency of zeros in the sequence tends to~$p$, and thus we can get better and better…

Let $P$ be a polynomial with integer coefficients and degree at least two. We prove an upper bound on the number of integer solutions $n\leq N$ to $n! = P(x)$ which yields a power saving over the trivial bound. In particular, this applies…

An elegant and fruitful way to bring harmonic analysis into the theory of orthogonal polynomials and special functions, or to associate certain Banach algebras with orthogonal polynomials satisfying a specific but frequently satisfied…

Inequalities among symmetric polynomial functions are fundamental questions in mathematics and have various applications in science and engineering. This paper investigates a beautiful and inspiring conjecture, proposed by Cuttler, Greene…

In this paper we revisit Talagrand's proof of concentration inequality for empirical processes. We give a different shorter proof of the main technical lemma that guarantees the existence of a certain kernel. Our proof provides the almost…

In order to verify programs or hybrid systems, one often needs to prove that certain formulas are unsatisfiable. In this paper, we consider conjunctions of polynomial inequalities over the reals. Classical algorithms for deciding these not…

Turing progressions have been often used to measure the proof-theoretic strength of mathematical theories. Turing progressions based on $n$-provability give rise to a $\Pi_{n+1}$ proof-theoretic ordinal. As such, to each theory $U$ we can…

We derive sharp, explicit constants in inverse trace inequalities for polynomial functions belonging to $\mathbb{P}_p(T)$ (polynomial space with total degree $p$) that are orthogonal to the lower-order subspace $\mathbb{P}_n(T)$, $n\leq p$,…

We prove an inequality for polynomials applied in a symmetric way to non-commuting operators.

We prove a weak-type (1,1) inequality for square functions of non-commutative martingales that are simultaneously bounded in $L^2$ and $L^1$. More precisely, the following non-commutative analogue of a classical result of Burkholder holds:…

In this article explicit formulas for the recurrence equation p_{n+1}(x) = (A_n x + B_n) p_n(x) - C_n p_{n-1}(x) and the derivative rules sigma(x) p'_n(x) = alpha_n p_{n+1}(x) + beta_n p_n(x) + gamma_n p_{n-1}(x) and sigma(x) p'_n(x) =…

In this paper we study the inverse of the eigenfunction $\sin_p$ of the one-dimensional $p$-Laplace operator and its dependence on the parameter $p$, and we present a Tur\'an type inequality for this function. Similar inequalities are given…

We target the problem of provably computing the equivalence between two complex expression trees. To this end, we formalize the problem of equivalence between two such programs as finding a set of semantics-preserving rewrite rules from one…

In this paper first we survey the Tur\'an type inequalities and related problems for the Bessel functions of the first kind. Then we extend the known higher order Tur\'an type inequalities for Bessel functions of the first kind to real…

Let $\overline{p}(n)$ denote the overpartition function. Liu and Zhang showed that $\overline{p}(a) \overline{p}(b)>\overline{p}(a+b)$ for all integers $a,b>1$ by using an analytic result of Engle. We offer in this paper a combinatorial…

A frequently cited theorem says that for n > 0 and prime p, the sum of the first p n-th powers is congruent to -1 modulo p if p-1 divides n, and to 0 otherwise. We survey the main ingredients in several known proofs. Then we give an…