Descent polynomials for labeled tree
Abstract
Motivated by the properties of the descent polynomials, which enumerate permutations of Sn with a fixed descent set, we define descent polynomials for labeled rooted trees. We give recursive and explicit formulas for these polynomials and show when known properties of the descent polynomials carry over to the setting of trees.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.