Dyck path enumeration

被引：187

作者：

Deutsch, E ^{[1
]}

机构：

[1] Polytech Univ, Dept Math, Brooklyn, NY 11201 USA

来源：

DISCRETE MATHEMATICS | 1999年 / 204卷 / 1-3期

关键词：

Dyck paths; combinatorial enumeration; generating functions; Catalan numbers; fine numbers; Narayana numbers; ordered trees; parallelogram polyominoes; non-crossing partitions; similarity relations;

D O I：

10.1016/S0012-365X(98)00371-9

中图分类号：

O1 [数学];

学科分类号：

0701 ; 070101 ;

摘要：

An elementary technique is used for the enumeration of Dyck paths according to various parameters. For several of the considered parameters the generating function is expressed in terms of the Narayana function. Many enumeration results are obtained, some of which involve the Fine numbers. (C) 1999 Elsevier Science B.V. All rights reserved.

引用

页码：167 / 202

页数：36