Total positivity of recursive matrices

From MaRDI portal




Abstract: Let A=[an,k]n,kge0 be an infinite lower triangular matrix defined by the recurrence a_{0,0}=1,quad a_{n+1,k}=r_{k}a_{n,k-1}+s_{k}a_{n,k}+t_{k+1}a_{n,k+1}, where an,k=0 unless ngekge0 and rk,sk,tk 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.




Cited in
(42)


Describes a project that uses

Uses Software





This page was built for publication: Total positivity of recursive matrices

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