2
votes
0answers
473 views

A combinatorial bound involving Stirling numbers of the second type

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 ...
4
votes
1answer
532 views

A bound involving Stirling numbers of the second kind and the asymptotics

Let $S_{n,r}$ denote the Stirling number of the second kind. Define $A_{n,r}:=\frac{\binom{n+r-1}{n}(n+r)!}{S_{n+r,r}r!}$. I want to prove: $A_{n,1}\ge A_{n,2}\ge..\ge A_{n,r}\ge \lim_{r\to\infty} ...