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 , and a sequence , such that the -entry of the matrix is the coefficient of the polynomial in the expansion of as a linear combination of the polynomials . We consider this general framework. For a non-decreasing sequence we establish necessary and sufficient conditions on the sequence 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.
Recommendations
Cites work
- \(\sigma\)-polynomials and graph coloring
- \(k\)-complementing subsets of nonnegative integers
- A unified approach to generalized Stirling numbers
- Applications of chromatic polynomials involving Stirling numbers
- Bell and Stirling numbers for graphs
- Combinatorially interpreting generalized Stirling numbers
- Combinatorics and total positivity
- Connections between the matching and chromatic polynomials
- Expansions of Chromatic Polynomials and Log-Concavity
- scientific article; zbMATH DE number 1113632 (Why is no real title available?)
- scientific article; zbMATH DE number 1136361 (Why is no real title available?)
- scientific article; zbMATH DE number 3368554 (Why is no real title available?)
- Inverses of triangular matrices and bipartite graphs
- Jacobi-Stirling numbers, Jacobi polynomials, and the left-definite analysis of the classical Jacobi differential expression
- Location of Zeros of Chromatic and Related Polynomials of Graphs
- On \(xD\)-generalizations of Stirling numbers and Lah numbers via graphs and rooks
- On the Vector Representations of Induced Matroids
- Restricted Stirling and Lah number matrices and their inverses
- Rook Theory. I.: Rook Equivalence of Ferrers Boards
- Rook theory. III: Rook polynomials and the chromatic structure of graphs
- Stirling numbers of forests and cycles
- Total positivity of recursive matrices
- Total positivity of Riordan arrays
- Total positivity: tests and parametrizations.
- Two approaches to normal order coefficients
Cited in
(15)- Combinatorial results on completely positive matrices
- Lah numbers and Lindström's lemma
- Combinatorics and total positivity
- Proof of a conjecture on the total positivity of amazing matrices
- Positivity properties of some special matrices
- Analytic combinatorics of coordination numbers of cubic lattices
- scientific article; zbMATH DE number 1136361 (Why is no real title available?)
- Total positivity of a shuffle matrix
- On Nonnegative Integer Matrices and Short Killing Words
- Recent developments in combinatorial aspects of normal ordering
- Totally non-negativity of a family of change-of-basis matrices
- Coefficientwise total positivity and Stieltjes moment properties from Riordan arrays
- On total positivity of Catalan-Stieltjes matrices
- On the totally positive matrices related to refined Eulerian numbers
- Trees, forests, and total positivity. I: \(q\)-trees and \(q\)-forests matrices
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)