Zeta Functions and the Log Behaviour of Combinatorial Sequences

From MaRDI portal



Abstract: In this paper, we use the Riemann zeta function zeta(x) and the Bessel zeta function zetamu(x) to study the log-behavior of combinatorial sequences. We prove that zeta(x) is log-convex for x>1. As a consequence, we deduce that the sequence |B2n|/(2n)!ngeq1 is log-convex, where Bn is the n-th Bernoulli number. We introduce the function heta(x)=(2zeta(x)Gamma(x+1))frac1x, where Gamma(x) is the gamma function, and we show that logheta(x) is strictly increasing for xgeq6. This confirms a conjecture of Sun stating that the sequence sqrt[n]|B2n|ngeq1 is strictly increasing. Amdeberhan, Moll and Vignat defined the numbers an(mu)=22n+1(n+1)!(mu+1)nzetamu(2n) and conjectured that the sequence an(mu)ngeq1 is log-convex for mu=0 and mu=1. By proving that zetamu(x) is log-convex for x>1 and mu>−1, we show that the sequence an(mu)ngeq1 is log-convex for any mu>−1. We introduce another function hetamu(x) involving zetamu(x) and the gamma function Gamma(x) and we show that loghetamu(x) is strictly increasing for x>8e(mu+2)2. This implies that sqrt[n]an(mu)<sqrt[n+1]an+1(mu) for n>4e(mu+2)2. Based on Dobinski's formula, we prove that sqrt[n]Bn<sqrt[n+1]Bn+1 for ngeq1, where Bn is the n-th Bell number. This confirms another conjecture of Sun. We also establish a connection between the increasing property of sqrt[n]Bnngeq1 and H"{o}lder's inequality in probability theory.












This page was built for publication: Zeta Functions and the Log Behaviour of Combinatorial Sequences

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2949788)