English

Totally nonnegative matrices, chain enumeration and zeros of polynomials

Combinatorics 2026-05-22 v3

Abstract

We prove that any lower unitriangular and totally nonnegative matrix gives rise to a family of polynomials with only real zeros. This has consequences for problems in several areas of mathematics. We use it to develop a general theory for chain enumeration in posets and zeros of chain polynomials. The results obtained extend and unify results of the first author, Brenti, Welker and Athanasiadis. In the process we define a notion of hh-vectors for a large class of posets which generalize the notions of hh-vectors associated to simplicial and cubical complexes. A consequence of our methods is a characterization of the convex hull of all characteristic polynomials of hyperplane arrangements of fixed dimension and over a fixed finite field. This may be seen as a refinement of the Critical Problem of Crapo and Rota. We also use the methods developed to answer an open problem posed by Forg\'acs and Tran on the real-rootedness of polynomials arising from certain bivariate rational functions.

Keywords

Cite

@article{arxiv.2412.06595,
  title  = {Totally nonnegative matrices, chain enumeration and zeros of polynomials},
  author = {Petter Brändén and Leonardo Saud Maia Leite},
  journal= {arXiv preprint arXiv:2412.06595},
  year   = {2026}
}

Comments

A thorough discussion on notions on shellabilty added. The notion of shellability for r-cubical posets is relaxed. Several typos corrected