Skip to main content

All Questions

4 questions with no upvoted or accepted answers
Filter by
Sorted by
Tagged with
11 votes
0 answers
387 views

Inequality for symmetric polynomial functions of log concave variables

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}$). ...
René Gy's user avatar
  • 505
3 votes
0 answers
203 views

A connection between the Bell numbers and Bell polynomial

Let $B(n,x) = \sum_{k=0}^n {n\brace k}x^k$ be the Bell polynomials and $B_n = B(n,1)$ be the Bell numbers. I recently proved a nice relation between the two: $$ B(n,x)^{1/n}/x \ge B_{n/x}^{x/n}, $$ ...
Thomas Dybdahl Ahle's user avatar
2 votes
0 answers
80 views

Inequality on polynomials

Recall $[n]_q=\frac{1-q^n}{1-q}, [n]!_q=[1]_q[2]_q\cdots[n]_q$ and the Gaussian polynomial $\binom{a}{b}_q=\frac{[a]!_q}{[b]!_q[a-b]!_q}$ with $[0]!_q:=1$. Given two polynomials $U(q)=\sum_k\alpha_kq^...
T. Amdeberhan's user avatar
1 vote
0 answers
105 views

Does this inequality follow from doubly log-concave?

On a sequence $(a_k)_{k\geq0}$ of positive integers, define the operator $\mathcal{L}a_k=a_k^2-a_{k-1}a_{k+1}$. Then, $(a_k)_k$ is called log-concave if $\mathcal{L}a_k\geq0$ for all $k\geq0$. One may ...
T. Amdeberhan's user avatar