A partition of the Catalan numbers and enumeration of genealogical trees
نویسنده
چکیده
A special relational structure, called genealogical tree, is introduced; its social interpretation and geometrical realizations are discussed. The numbers Cn,k of all abstract genealogical trees with exactly n+1 nodes and k leaves is found by means of enumeration of code words. For each n, the Cn,k form a partition of the n-th Catalan numer Cn, that means Cn,1 + Cn,2 + · · ·+ Cn,n = Cn.
منابع مشابه
Generalized Catalan numbers and the enumeration of planar embeddings
The Raney numbers Rp,r(k) are a two-parameter generalization of the Catalan numbers that were introduced by Raney in his investigation of functional composition patterns. We give a new combinatorial interpretation for the Raney numbers in terms of planar embeddings of certain collections of trees, a construction that recovers the usual interpretation of the p-Catalan numbers in terms of p-ary t...
متن کاملCombinatoric Results for Graphical Enumeration and the Higher Catalan Numbers
We summarize some combinatoric problems solved by the higher Catalan numbers. These problems are generalizations of the combinatoric problems solved by the Catalan numbers. The generating function of the higher Catalan numbers appeared recently as an auxiliary function in enumerating maps and explicit computations of the asymptotic expansion of the partition function of random matrices in the u...
متن کاملCuntz-krieger Algebras and a Generalization of Catalan Numbers
We first observe that the relations of the canonical generating isometries of the Cuntz algebra ON are naturally related to the N-colored Catalan numbers. For a directed graph G, we generalize the Catalan numbers by using the canonical generating partial isometries of the Cuntz-Krieger algebra O AG for the transition matrix A of G. The generalized Catalan numbers cGn , n = 0, 1, 2, . . . enumer...
متن کاملEnumeration of 1- and 2-crossing Partitions with Refinements
An enumeration of the 1-crossing partitions of [n] into k blocks by bijection with ordered trees with n edges, k internal nodes, and root degree j = 4 is presented. A semi-bijection of these ordered trees to Dyck paths of semilength n, k peaks, and j = 4 last peak height is used to derive a conjectured formula for the number of 1-crossing partitions of [n] with k blocks. We also explore some na...
متن کاملOld and young leaves on plane trees
A leaf of a plane tree is called an old leaf if it is the leftmost child of its parent, and it is called a young leaf otherwise. In this paper we enumerate plane trees with a given number of old leaves and young leaves. The formula is obtained combinatorially by presenting two bijections between plane trees and 2-Motzkin paths which map young leaves to red horizontal steps, and old leaves to up...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Discussiones Mathematicae Graph Theory
دوره 16 شماره
صفحات -
تاریخ انتشار 1996