Total positivity of Riordan arrays
arXiv:1601.05637 · doi:10.1016/j.ejc.2014.11.009
Abstract
We present sufficient conditions for total positivity of Riordan arrays. As applications we show that many well-known combinatorial triangles are totally positive and many famous combinatorial numbers are log-convex in a unified approach.
References in corpus (2)
Cited by in corpus (16)
- Total positivity of recursive matrices
- Catalan-like numbers and Stieltjes moment sequences
- Lattice paths and branched continued fractions. II. Multivariate Lah polynomials and Lah symmetric functions
- Total positivity of some polynomial matrices that enumerate labeled trees and forests, I. Forests of rooted labeled trees
- Analytic combinatorics of coordination numbers of cubic lattices
- Lattice paths and branched continued fractions. III. Generalizations of the Laguerre, rook and Lah polynomials
- Stieltjes moment sequences of polynomials
- Bijective recurrences concerning two Schröder triangles
- Catalan-like numbers and Hausdorff moment sequences
- Combinatorial identities related to submatrices of recursive matrices
- Yet another criterion for the total positivity of Riordan arrays
- Enumerating several statistics of r-Colored Dyck paths with no dd-steps having the same colors
- On a Stirling-Whitney-Riordan triangle
- Total positivity of Narayana matrices
- Stieltjes moment properties and continued fractions from combinatorial triangles
- Total positivity from the exponential Riordan arrays