Abstract
The number of descents (respectively, ascents) in a tree T ∈Tn rooted at r∈[n] is denoted d r (T) (respectively, a r (T)) where Tn is the set of all trees with vertex set [n]. Let d r (n, k) (respectively, a r (n, k)) denote the number of trees in Tn rooted at r with precisely k descents (respectively, k ascents). Among our results are central limit theorems and local limit theorems for d r (T) and a r (T) for r=1, n when T is chosen uniformly at random from Tn. We also give asymptotic formulas for max k d r (n, k) and max k a r (n, k) and formulas for their modes for r=1, n.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
More From: Journal of Discrete Mathematical Sciences and Cryptography
Disclaimer: 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.