A combinatorial proof of the log-convexity of sequences in Riordan arrays

DOI10.1007/s10801-020-00966-zzbMath1470.05025OpenAlexW3049424050MaRDI QIDQ2045059

Yuzhenni Wang, Xi Chen, Sai-Nan Zheng

Publication date: 11 August 2021

Published in: Journal of Algebraic Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10801-020-00966-z

zbMATH Keywords

log-convexityRiordan arrayŁukasiewicz path

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15) Permutations, words, matrices (05A05) Combinatorial inequalities (05A20) Miscellaneous inequalities involving matrices (15A45) Special matrices (15B99)

Related Items (1)

Left multiplication operators on the Riordan group

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Log-convexity and strong \(q\)-\(\log\)-convexity for some triangular arrays
• Combinatorics of Riordan arrays with identical \(A\) and \(Z\) sequences
• Schur positivity and the \(q\)-log-convexity of the Narayana polynomials
• Some operator convex functions of several variables
• The \(q\)-log-convexity of the Narayana polynomials of type \(B\)
• Sequence characterization of Riordan arrays
• The Riordan group
• Catalan-like numbers and determinants
• Total positivity of Riordan arrays
• Total positivity of recursive matrices
• Enumeration via ballot numbers
• On the log-convexity of combinatorial sequences
• On Some Alternative Characterizations of Riordan Arrays

This page was built for publication: A combinatorial proof of the log-convexity of sequences in Riordan arrays