Total positivity of some polynomial matrices that enumerate labeled trees and forests. II. Rooted labeled trees and partial functional digraphs

From MaRDI portal
Publication:6425820




Abstract: We study three combinatorial models for the lower-triangular matrix with entries : two involving rooted trees on the vertex set [n+1], and one involving partial functional digraphs on the vertex set [n]. We show that this matrix is totally positive and that the sequence of its row-generating polynomials is coefficientwise Hankel-totally positive. We then generalize to polynomials tn,k(y,z) that count improper and proper edges, and further to polynomials tn,k(y,mathbfphi) in infinitely many indeterminates that give a weight y to each improper edge and a weight m!,phim for each vertex with m proper children. We show that if the weight sequence mathbfphi is Toeplitz-totally positive, then the two foregoing total-positivity results continue to hold. Our proofs use production matrices and exponential Riordan arrays.









This page was built for publication: Total positivity of some polynomial matrices that enumerate labeled trees and forests. II. Rooted labeled trees and partial functional digraphs

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