๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

A bijection on Dyck paths and its consequences

โœ Scribed by Emeric Deutsch


Publisher
Elsevier Science
Year
1998
Tongue
English
Weight
175 KB
Volume
179
Category
Article
ISSN
0012-365X

No coin nor oath required. For personal study only.

โœฆ Synopsis


A bijection is introduced in the set of all Dyck paths of semilength n from which it follows that (i) the parameters 'height of the first peak' and 'number of returns' have the same distribution and (ii) the parameter 'number of high peaks' has the Narayana distribution.


๐Ÿ“œ SIMILAR VOLUMES


A Bijection on Ordered Trees and Its Con
โœ Emeric Deutsch ๐Ÿ“‚ Article ๐Ÿ“… 2000 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 214 KB

A bijection is introduced in the set of all ordered trees having n edges from which one derives that, for each positive integer q, the parameters "number of nodes of degree q" and "number of odd-level nodes of degree q-1" are equidistributed.

A Bijection for Some Paths on the Slit P
โœ Elena Barcucci; Elisa Pergola; Renzo Pinzani; Simone Rinaldi ๐Ÿ“‚ Article ๐Ÿ“… 2001 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 125 KB

This paper deals with a study of the class of lattice paths, made of north, east, south, and west unit steps, which being at -1 0 and end at 0 0 , avoiding the non-negative x-axis. is bijectively proved to be enumerated by odd index Catalan numbers according to the number of steps.

Nondecreasing Dyck paths and q-Fibonacci
โœ E. Barcucci; A. Del Lungo; S. Fezzi; R. Pinzani ๐Ÿ“‚ Article ๐Ÿ“… 1997 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 306 KB

In this paper, we introduce a subclass of the Dyck paths (Delest and Viennot, 1984) called nondecreasing Dyck paths which are enumerated by the Fibonacci numbers having odd indexes. We then use two different methods to enumerate these paths according to various parameters. By the first one, used in