Archived
This content is available here strictly for research, reference, and/or recordkeeping and as such it may not be fully accessible. If you work or study at University of Kentucky and would like to request an accessible version, please use the SensusAccess Document Converter.
Abstract
We consider the generating polynomial of the number of rooted trees on the set {1,2,...,n} counted by the number of descending edges (a parent with a greater label than a child). This polynomial is an extension of the descent generating polynomial of the set of permutations of a totally ordered n-set, known as the Eulerian polynomial. We show how this extension shares some of the properties of the classical one. A classical product formula shows that this polynomial factors completely over the integers. From this product formula it can be concluded that this polynomial has positive coefficients in the γ-basis and we show that a formula for these coefficients can also be derived. We discuss various combinatorial interpretations of these coefficients in terms of leaf-labeled binary trees and in terms of the Stirling permutations introduced by Gessel and Stanley. These interpretations are derived from previous results of Liu, Dotsenko-Khoroshkin, Bershtein-Dotsenko-Khoroshkin, González D'León-Wachs and González D'León related to the free multibracketed Lie algebra and the poset of weighted partitions.
Document Type
Article
Publication Date
2-5-2016
Funding Information
Rafael S. González D'León supported by NSF Grant DMS 1202755.
Repository Citation
González D'León, Rafael S., "A Note on the γ-Coefficients of the Tree Eulerian Polynomial" (2016). Mathematics Faculty Publications. 20.
https://uknowledge.uky.edu/math_facpub/20
Notes/Citation Information
Published in The Electronic Journal of Combinatorics, v. 23, issue 1, paper #P1.20, p. 1-13.
The publisher has granted the permission for posting the article here.