Total non-negativity of some combinatorial matrices

From MaRDI portal
Publication:2299628



Abstract: Many combinatorial matrices --- such as those of binomial coefficients, Stirling numbers of both kinds, and Lah numbers --- are known to be totally non-negative, meaning that all minors (determinants of square submatrices) are non-negative. The examples noted above can be placed in a common framework: for each one there is a non-decreasing sequence (a1,a2,ldots), and a sequence (e1,e2,ldots), such that the (m,k)-entry of the matrix is the coefficient of the polynomial (x−a1)cdots(x−ak) in the expansion of (x−e1)cdots(x−em) as a linear combination of the polynomials 1,x−a1,ldots,(x−a1)cdots(x−am). We consider this general framework. For a non-decreasing sequence (a1,a2,ldots) we establish necessary and sufficient conditions on the sequence (e1,e2,ldots) for the corresponding matrix to be totally non-negative. As corollaries we obtain totally non-negativity of matrices of rook numbers of Ferrers boards, and of graph Stirling numbers of chordal graphs.












This page was built for publication: Total non-negativity of some combinatorial matrices

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