Total positivity of recursive matrices

By X. Chen, Huyile Liang, Yi Wang. 2015

62 citations recorded by the source corpus.

Abstract Let A = [ a n , k ] n , k ≥ 0 be an infinite lower triangular matrix defined by the recurrence a 0 , 0 = 1 , a n + 1 , k = r k a n , k − 1 + s k a n , k + t k + 1 a n , k + 1 , where a n , k = 0 unless n ≥ k ≥ 0 and r k , s k , t k are all nonnegative. Many well-known combinatorial triangles are such matrices, including the Pascal triangle, the Stirling triangle (of the second kind), the Bell triangle, the Catalan triangles of Aigner and Shapiro. We present some sufficient conditions such that the recursive matrix A is totally positive. As applications we give the total positivity of the above mentioned combinatorial triangles in a unified approach.

Subfields: Discrete Mathematics and Combinatorics, Electrical and Electronic Engineering, Geometry and Topology

View Paper: https://www.semanticscholar.org/paper/3c0f69f3e90909c6347fb92791c5370b2a089fd6