Abstract
We generalize the concept of ascending and descending runs from permutations to rooted labelled trees and mappings, i.e., functions from the set {1,…,n} into itself. A combinatorial decomposition of the corresponding functional digraph together with a generating functions approach allows us to perform a joint study of ascending and descending runs in labelled trees and mappings, respectively. From the given characterization of the respective generating functions we can deduce bivariate central limit theorems for these quantities. Furthermore, for ascending runs (or descending runs) we gain explicit enumeration formulæ showing a connection to Stirling numbers of the second kind. We also give a bijective proof establishing this relation, and further state a bijection between mappings and labelled trees connecting the quantities in both structures.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
