Total positivity of some polynomial matrices that enumerate labeled trees and forests, I. Forests of rooted labeled trees

DOI10.1007/S00605-022-01687-0arXiv2105.05583MaRDI QIDQ6367481FDOQ6367481

Publication date: 12 May 2021

Abstract: We consider the lower-triangular matrix of generating polynomials that enumerate

k

-component forests of rooted trees on the vertex set

[n]

according to the number of improper edges (generalizations of the Ramanujan polynomials). We show that this matrix is coefficientwise totally positive and that the sequence of its row-generating polynomials is coefficientwise Hankel-totally positive. More generally, we define the generic rooted-forest polynomials by introducing also a weight

m!, p h i_{m}

for each vertex with

m

proper children. We show that if the weight sequence

p h i

is Toeplitz-totally positive, then the two foregoing total-positivity results continue to hold. Our proofs use production matrices and exponential Riordan arrays.

Mathematics Subject Classification ID

Trees (05C05) Exact enumeration problems, generating functions (05A15) Positive matrices and their generalizations; cones of matrices (15B48) Matrices of integers (15B36) Combinatorial identities, bijective combinatorics (05A19) Enumeration in graph theory (05C30) Graph labelling (graceful graphs, bandwidth, etc.) (05C78) Toeplitz, Cauchy, and related matrices (15B05) Moment problems and interpolation problems in the complex plane (30E05) Combinatorial inequalities (05A20) Moment problems (44A60)

This page was built for publication: Total positivity of some polynomial matrices that enumerate labeled trees and forests, I. Forests of rooted labeled trees

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