Totally non-negativity of a family of change-of-basis matrices
David Galvin, Yufei Zhang

TL;DR
This paper characterizes when a family of change-of-basis matrices, encoding combinatorial sequences, is totally non-negative, providing a practical check and a planar network representation for such matrices.
Contribution
It extends previous results by giving a complete, efficient criterion for total non-negativity of these matrices for arbitrary real sequences.
Findings
Provides an $O(n^2)$ algorithm to determine total non-negativity.
Characterizes total non-negativity via planar network representations.
Identifies explicit negative minors when matrices are not totally non-negative.
Abstract
Let and be real sequences. Denote by the matrix whose entry () is the coefficient of the polynomial in the expansion of as a linear combination of the polynomials . By appropriate choice of and the matrix can encode many familiar doubly-indexed combinatorial sequences, such as binomial coefficients, Stirling numbers of both kinds, Lah numbers and central factorial numbers. In all four of these examples, enjoys the property of total non-negativity -- the determinants of all its square submatrices are non-negative. This leads to a natural question: when, in general,…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdvanced Topics in Algebra · graph theory and CDMA systems · semigroups and automata theory
