Take the 2-minute tour ×
MathOverflow is a question and answer site for professional mathematicians. It's 100% free, no registration required.

My previous question was solved in a very elegant way, hopefully this (seemingly more complicated) case is also easy for experts.

I need the inequality $\Big(\prod^r_{i=1}p_i\Big)\sum^n_{j=0}(-1)^j\bigg(\sum\limits_{\substack{(k_1,\dots,k_r),\ k_i\ge0\\\sum_i k_i=n-j}}\prod_{i=1}^r(p_i-1)^{k_i}\bigg)-(-1)^n\ge A_{n,r}\Big(\prod^r_{i=1}p_i\Big)\sum\limits_{\substack{k_1,\dots, k_r\geq 0\\\sum_i k_i=n}}\prod^r_{i=1}\binom{p_i-1}{k_i}\frac{1}{k_i+1}$

Here $n\ge3$ and $A_{n,r}:=\frac{\binom{n+r−1}{n}(n+r)!}{r!S_{n+r,r}}$, with $S_{n+r,r}$- Stirling numbers of the second kind. Some properties of $A_{n,r}$ are given here. The numbers $n,r,p_i$ are positive integers.

I tried various naive approaches (some inductions or to check that some things cancel out). With no success. Though I can prove the inequality for $r=1$ or for $n=3$. Already the case $n=4$ gets too messy. (And of course I checked numerically for a variety of cases.) Even a simpler version would be quite helpful:

$\sum\limits_{\substack{\{k_i\ge0\}\\\sum_i k_i=n}}\prod_{i=1}^r(p_i-1)^{k_i}\ge A_{n,r}\sum\limits_{\substack{\{k_i\geq 0\}\\\sum_i k_i=n}}\prod^r_{i=1}\binom{p_i-1}{k_i}\frac{1}{k_i+1}$

Any suggestions?

upd. We succeeded to prove this inequality, though in a terribly complicated way. Still I would like to see some short proof.

share|improve this question
add comment

Your Answer

 
discard

By posting your answer, you agree to the privacy policy and terms of service.

Browse other questions tagged or ask your own question.