Recursive Generation of k-ary Trees

被引：0

作者：

Manes, K. ^{[1
]}

Sapounakis, A. ^{[1
]}

Tasoulas, I. ^{[1
]}

Tsikouras, P. ^{[1
]}

机构：

[1] Univ Piraeus, Dept Informat, Piraeus 18534, Greece

来源：

JOURNAL OF INTEGER SEQUENCES | 2009年 / 12卷 / 07期

关键词：

Generalized Dyck words; k-ary trees; k-Catalan numbers;

D O I：

暂无

中图分类号：

O1 [数学];

学科分类号：

0701 ; 070101 ;

摘要：

In this paper we present a construction of every k-ary tree using a forest of (k - 1)-ary trees satisfying a particular condition. We use this method recursively for the construction of the set of k-ary trees from the set of (k - 1)-Dyck paths, thus obtaining a new bijection phi between these two sets. Furthermore, we introduce a new order on [k]* which is used for the full description of this bijection. Finally, we study some new statistics on k-ary trees which are transferred by phi to statistics concerning the occurrence of strings in (k - 1) -Dyck paths.

引用

页数：18

共 22 条

[1] Parallel generation of t-ary trees in A-order [J].