The author gives two new proofs of the following fact first discovered by Gessel: in the set of rooted labeled trees of \(n+1\) vertices rooted at the smallest vertex, the number of trees with \(a\) descents and \(b+1\) leaves equals the number of trees with \(b\) descents and \(a+1\) leaves (a descent is a vertex whose label is greater than at least one of its children labels). His approach uses decompositions of trees and leads to a generalization of a well-known bijection from \(\{1,\dots, n\}\) to increasing trees (i.e. trees with no descents) and to a generalization found by Knuth involving intransitive trees. One of these decompositions is related to symmetry in parking functions. The received results are generalized to binary trees.
- A symmetry on parking functions via Dyck paths
- Parking functions and tree inversions revisited
- Symmetries and Ramsey properties of trees
- Trees, parking functions and factorizations of full cycles
- Parking functions on oriented trees
- scientific article; zbMATH DE number 1182849
- G-parking functions and tree inversions
- The symmetry number problem for trees
- Parking function varieties for combinatorial tree models
- Generalized tree inversions and \(k\)-parking functions
- Permuted composition tableaux, 0-Hecke algebra and labeled binary trees
- Deformations of the braid arrangement and trees
- Gessel polynomials, rooks, and extended linial arrangements
- Schur positivity and labeled binary trees
- Counting forests by descents and leaves
- Labeled binary trees, subarrangements of the Catalan arrangements, and Schur positivity
- A symmetry on parking functions via Dyck paths
- Descents in parking functions
- Smirnov trees
- Smirnov trees
- Descent polynomials for labeled trees
- Labeling regions in deformations of graphical arrangements
- Runs in labelled trees and mappings
- Generalized parking functions, descent numbers, and chain polytopes of ribbon posets
This page was built for publication: Symmetries in trees and parking functions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1849980)
