Related papers: A Maclaurin type inequality

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…

In this paper, we extend the classical Newton-Maclaurin inequalities to functions $S_{k;s}(x)=E_k(x)+\dsum_{i=1}^s \al_i E_{k-i}(x)$, which are formed by linear combinations of multiple basic symmetric mean. We proved that when the…

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…

It is known that the elementary symmetric polynomials $e_k(x)$ have the property that if $ x, y \in [0,\infty)^n$ and $e_k(x) \leq e_k(y)$ for all $k$, then $||x||_p \leq ||y||_p$ for all real $0\leq p \leq 1$, and moreover $||x||_p \geq…

Assume $n\geq 2$. Consider the elementary symmetric polynomials $e_k(y_1,y_2,\ldots, y_n)$ and denote by $E_0,E_1,\ldots,E_{n-1}$ the elementary symmetric polynomials in reverse order \begin{align*}…

In this paper, we prove Newton-Maclaurin type inequalities for functions obtained by linear combination of two neighboring primary symmetry functions, which is a generalization of the classical Newton-Maclaurin inequality.

We establish Hadamard-type inequalities for a class of symmetric matrices called $k$-positive matrices for which the $m$-th elementary symmetric functions of their eigenvalues are positive for all $m\leq k$. These matrices arise naturally…

We give a combinatorial extension of the classical inequalities of Maclaurin about symmetric functions of several variables. We discuss two problems - one analytical and another combinatorial - and show that they are in some sense…

The Orlicz $\left( \ell_{2},\ell_{1}\right) $-mixed inequality states that $$ \left( \sum_{j_{1}=1}^{n}\left( \sum_{j_{2}=1}^{n}\left\vert A(e_{j_{1} },e_{j_{2}})\right\vert \right) ^{2}\right) ^{\frac{1}{2}}\leq\sqrt {2}\left\Vert…

The Euler-Maclaurin formula which relates a discrete sum with an integral, is generalised to the setting of Riemann-Stieltjes sums and integrals on stochastic processes whose paths are a.s. rectifiable, namely, continuous and with bounded…

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…

We identify a surprising inequality satisfied by elementary symmetric polynomials under the action of the fixed point measure of a random permutation. Concretely, for any collection of $n$ non-negative real numbers $a_1, \dots, a_n \in…

We improve upon a result of Steinerberger (2024) by demonstrating that for any fixed $k \in \mathbb{N}$ and sufficiently large $n$, there exist integers $1 \leq a_1, \dots, a_k \leq n$ satisfying: \begin{align*} 0 < \left\| \sum_{j=1}^{k}…

The first-order Euler-Maclaurin formula relates the sum of the values of a smooth function on an interval of integers with its integral on the same interval on $\mathbb R$. We formulate here the analogue for functions that are just of…

For $n$ positive numbers ($a_k$, $1\leq k \leq n$), enhanced inequalities about the arithmetic mean ($A_n \equiv \frac{\sum_ka_k}{n}$) and the geometric mean ($G_n\equiv \sqrt[n]{\Pi_ka_k}$) are found if some numbers are known, namely,…

Let $\tau_k(n)$ be the $k$-th divisor function. In this paper, we derive an asymptotic formula for the sum $$ \sum_{1\leq n_1,n_2, \dots, n_{\ell}\leq X^{\frac{1}{r}} \atop 1\leq n_{\ell+1}\le X^{\frac{1}{s}}}\tau_k(n_1^r+n_2^r+\dots…

Following the work of B. Kuelshammer, J. B. Olsson and G. R. Robinson on generalized blocks of the symmetric groups, we give a definition for the \ell-defect of characters of the symmetric group S_n, where \ell > 1 is an arbitrary integer.…

We prove that the cyclic inequality $\sum\limits_{i=1}^{i=n}\left(\frac{x_i}{x_{i+1}}\right)^k\geq\sum\limits_{i=1}^{i=n}\frac{x_i}{x_{\sigma(i)}}$ holds for $k$ in a specific range dependant on the permutation $\sigma$. We also show that…

We examine the general element of the class of ordinary differential equations, $yy^{(n+1)}+\alpha y'y^{(n)}=0$, for its Lie point symmetries. We observe that the algebraic properties of this class of equations display an attractive set of…

The Shapley-Folkman theorem shows that Minkowski averages of uniformly bounded sets tend to be convex when the number of terms in the sum becomes much larger than the ambient dimension. In optimization, Aubin and Ekeland [1976] show that…