Zeta Functions and the Log-behavior of Combinatorial Sequences
arXiv:1208.5213
Abstract
In this paper, we use the Riemann zeta function and the Bessel zeta function to study the log-behavior of combinatorial sequences. We prove that is log-convex for . As a consequence, we deduce that the sequence is log-convex, where is the -th Bernoulli number. We introduce the function , where is the gamma function, and we show that is strictly increasing for . This confirms a conjecture of Sun stating that the sequence is strictly increasing. Amdeberhan, Moll and Vignat defined the numbers and conjectured that the sequence is log-convex for and . By proving that is log-convex for and , we show that the sequence is log-convex for any . We introduce another function involving and the gamma function and we show that is strictly increasing for . This implies that for . Based on Dobinski's formula, we prove that for , where is the -th Bell number. This confirms another conjecture of Sun. We also establish a connection between the increasing property of and Hölder's inequality in probability theory.
16 pages; to appear in Proc. Edinburgh Math. Soc. (2)