Related papers: On a cyclic inequality with exponents and permutat…

By means of the mathematical analysis theory, inequality theory, mathematical induction and the dimension reduction method, under the proper hypotheses, we establish the following cyclic inequalities: \[\sum_{i=1}^{n}…

We show that any weighted geometric mean of Chebyshev polynomials is bounded from above by another Chebyshev polynomial. We also study a related homogeneous cyclic inequality $$ \left (\sum_{i=1}^n x_i^{(a+b+1)/2} \right )^2 \geq…

Let $\mathbf{x}=(x_1,\dots,x_n)$ be an $n$-tuple of positive real numbers and the sequence $(x_i)_{i\in\mathbb{Z}}$ be its $n$-periodic extension. Given an $n$-tuple $\mathbf{r}=(r_1,\dots,r_n)$ of positive integers, let $a_i$ be the…

The main aim of this paper is to prove that the double inequality \frac{(k-1)!}{\Bigl\{x+\Bigl[\frac{(k-1)!}{|\psi^{(k)}(1)|}\Bigr]^{1/k}\Bigr\}^k}…

We prove the \emph{sum of squared logarithms inequality} (SSLI) which states that for nonnegative vectors $x, y \in \mathbb{R}^n$ whose elementary symmetric polynomials satisfy $e_k(x)\le e_k(y)$ (for $1\le k < n$) and $e_n(x)=e_n(y)$, the…

In this paper we study different restrictions imposed over the set of permutations of size $n$, $S_n$, and for specific classes of restrictions study the cycle structure of corresponding permutations. More specifically, we prove that for…

In this paper we prove a Large Deviation Principle for the sequence of symmetrised empirical measures $\frac{1}{n} \sum_{i=1}^{n} \delta_{(X^n_i,X^n_{\sigma_n(i)})}$ where $\sigma_n$ is a random permutation and $((X_i^n)_{1 \leq i \leq…

Given $n$ real numbers $0\leq x_1,...,x_n<1$ and a permutation~$\sigma$ of $\{1,...,n\}$, we can always find $\xbar_1,...,\xbar_n\in\{0,1\}$ so that the partial sums $\xbar_1+... +\xbar_k$ and $\xbar_{\sigma 1}+... +\xbar_{\sigma k}$ differ…

Assume that a convergent series of real numbers $\sum\limits_{n=1}^\infty a_n$ has the property that there exists a set $A\subseteq \N$ such that the series $\sum\limits_{n \in A} a_n$ is conditionally convergent. We prove that for a given…

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)…

We provide a cyclic permutation analogue of the Erd\H os-Szekeres theorem. In particular, we show that every cyclic permutation of length $(k-1)(\ell-1)+2$ has either an increasing cyclic sub-permutation of length $k+1$ or a decreasing…

The classical Maclaurin inequality asserts that the elementary symmetric means $$ s_k(y) = \frac{1}{\binom{n}{k}} \sum_{1 \leq i_1 < \dots < i_k \leq n} y_{i_1} \dots y_{i_k}$$ obey the inequality $s_\ell(y)^{1/\ell} \leq s_k(y)^{1/k}$…

Let $\sigma(n)$ denotes the sum of divisors function of a positive integer $n$. Robin proved that the Riemann hypothesis is true if and only if the inequality $\sigma(n) < e^{\gamma}n \log \log n$ holds for every positive integer $n \geq…

We prove the property that a function is cyclic (resp., non-cyclic) is not preserved by norm convergence in Dirichlet-type spaces $D_\alpha$, and show how other significant quantities for cyclicity do remain preserved under the limit of…

We show that for every $0 < \epsilon \leq 1$ and integer $k\geq 1$, there exists an integer $n = n(\epsilon,k)$ so that for all primes $p$, and integers $0 \leq a \leq p-1$, there exist integers $1 \leq x_1 < ... < x_n \leq p^\epsilon$ such…

The aim of this note is to show that certain number theoretic inequalities due to Nesbitt and Shapiro have noncommutative counterparts involving positive definite matrices.

Let S_n=X_1+...+X_n be a sum of independent symmetric random variables such that |X_{i}|\leq 1. Denote by W_n=\epsilon_{1}+...+\epsilon_{n} a sum of independent random variables such that \prob{\eps_i = \pm 1} = 1/2. We prove that…

We consider the cycle structure of a random permutation $\sigma$ chosen uniformly from the symmetric group, subject to the constraint that $\sigma$ does not contain cycles of length exceeding $r.$ We prove that under suitable conditions the…

We show, conditional on a uniform version of the prime k-tuples conjecture, that there are x(log x)^{-1+o(1)} numbers not exceeding x common to the ranges of Euler's function phi(n) and the sum-of-divisors function sigma(m).

For an array $\left\{X_{n,j}, \, 1 \leqslant j \leqslant k_{n}, n \geqslant 1 \right\}$ of random variables and a sequence $\{c_{n} \}$ of positive numbers, sufficient conditions are given under which, for all $\varepsilon > 0$,…