{"docId":4322,"paperId":3964,"url":"https:\/\/dmtcs.episciences.org\/3964","doi":"10.23638\/DMTCS-20-1-11","journalName":"Discrete Mathematics & Theoretical Computer Science","issn":"","eissn":"1365-8050","volume":[{"vid":324,"name":"Vol. 20 no. 1"}],"section":[{"sid":2,"title":"Analysis of Algorithms","description":[]}],"repositoryName":"arXiv","repositoryIdentifier":"1704.03734","repositoryVersion":3,"repositoryLink":"https:\/\/arxiv.org\/abs\/1704.03734v3","dateSubmitted":"2017-09-28 11:04:56","dateAccepted":"2018-02-28 16:37:08","datePublished":"2018-02-28 16:37:21","titles":["Growing and Destroying Catalan-Stanley Trees"],"authors":["Hackl, Benjamin","Prodinger, Helmut"],"abstracts":["Stanley lists the class of Dyck paths where all returns to the axis are of odd length as one of the many objects enumerated by (shifted) Catalan numbers. By the standard bijection in this context, these special Dyck paths correspond to a class of rooted plane trees, so-called Catalan-Stanley trees. This paper investigates a deterministic growth procedure for these trees by which any Catalan-Stanley tree can be grown from the tree of size one after some number of rounds; a parameter that will be referred to as the age of the tree. Asymptotic analyses are carried out for the age of a random Catalan-Stanley tree of given size as well as for the \"speed\" of the growth process by comparing the size of a given tree to the size of its ancestors."],"keywords":["Mathematics - Combinatorics","05A16, 05C05, 05A15"]}