All Questions

Let $2 \leq m \leq n$ be integers and let $\mathbf{x} \in \mathbb{R}^n$ (importantly, I am not assuming that the entries of $\mathbf{x}$ are non-negative). The elementary symmetric polynomials are ...

Let $(x_i)_{i \ge 1}$ be a log-concave (resp. log-convex) sequence of non-negative real variables. In other words, for $i \ge 2$, we have $x_i^2 \ge x_{i-1}x_{i+1}$ (resp. $x_i^2 \le x_{i-1}x_{i+1}$). ...

Fix integers $1 \leq k \leq n$ and suppose $\mathbf{x} \in \mathbb{R}^n$ is such that $e_j(x_1,x_2,\ldots,x_n) \geq 0$ for all $1 \leq j \leq k$, where $e_j$ is the $j$-th elementary symmetric ...

I improve my previous question. Because this conjecture is exactly natural development of A Muirhead Like Inequality and Muirhead's Inequality so I think the conjecture is true. But I can not prove it....

Combine my first previous question and second previous question with the Muirhead inequality. I have posed conjectures of two inequalities as follows: Inequality 1: Let $n>2$ and $1 \le m \le n$...