32 citations · 36 across the 2 of their papers we have counts for
Showing math.COShow all
2 papers · 1 filter
math.CO2006★ 4 cited
Calculus proofs of some combinatorial inequalities
Tomislav Došlić, Darko Veljan
Using calculus we show how to prove some combinatorial inequalities of the type log-concavity or log-convexity. It is shown by this method that binomial coefficients and Stirling n…
math.CO2006★ 32 cited
Log-balanced combinatorial sequences
Tomislav Došlić
We consider log-convex sequences that satisfy an additional constraint imposed on their rate of growth. We call such sequences log-balanced. It is shown that all such sequences sat…