Infinitely log-monotonic combinatorial sequences

From MaRDI portal
Publication:395243

DOI10.1016/J.AAM.2013.08.003zbMATH Open1281.05019arXiv1304.5160OpenAlexW3098454461MaRDI QIDQ395243FDOQ395243


Authors: William Y. C. Chen, Jeremy J. F. Guo, Larry X. W. Wang Edit this on Wikidata


Publication date: 29 January 2014

Published in: Advances in Applied Mathematics (Search for Journal in Brave)

Abstract: We introduce the notion of infinitely log-monotonic sequences. By establishing a connection between completely monotonic functions and infinitely log-monotonic sequences, we show that the sequences of the Bernoulli numbers, the Catalan numbers and the central binomial coefficients are infinitely log-monotonic. In particular, if a sequence anngeq0 is log-monotonic of order two, then it is ratio log-concave in the sense that the sequence an+1/anngeq0 is log-concave. Furthermore, we prove that if a sequence anngeqk is ratio log-concave, then the sequence sqrt[n]anngeqk is strictly log-concave subject to a certain initial condition. As consequences, we show that the sequences of the derangement numbers, the Motzkin numbers, the Fine numbers, the central Delannoy numbers, the numbers of tree-like polyhexes and the Domb numbers are ratio log-concave. For the case of the Domb numbers Dn, we confirm a conjecture of Sun on the log-concavity of the sequence sqrt[n]Dnngeq1.


Full work available at URL: https://arxiv.org/abs/1304.5160




Recommendations




Cites Work


Cited In (21)





This page was built for publication: Infinitely log-monotonic combinatorial sequences

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