Exterior pairs and up step statistics on Dyck paths (Q540090)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 5903022
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Exterior pairs and up step statistics on Dyck paths |
scientific article; zbMATH DE number 5903022 |
Statements
Exterior pairs and up step statistics on Dyck paths (English)
0 references
1 June 2011
0 references
Summary: Let \(\mathcal{C}_n\) be the set of Dyck paths of length \(n\). In this paper, by a new automorphism of ordered trees, we prove that the statistic `number of exterior pairs', introduced by A. Denise and R. Simion, on the set \(\mathcal{C}_n\) is equidistributed with the statistic `number of up steps at height \(h\) with \(h\equiv 0\pmod 3\)'. Moreover, for \(m\geq 3\), we prove that the two statistics `number of up steps at height \(h\) with \(h\equiv 0 \pmod m\)' and `number of up steps at height \(h\) with \(h\equiv m-1 \pmod m\)' on the set \(\mathcal{C}_n\) are `almost equidistributed'. Both results are proved combinatorially.
0 references
Dyck path
0 references
exterior pair
0 references
ordered tree
0 references
planted tree
0 references
continued fraction
0 references
0.8217948079109192
0 references
0.8190245032310486
0 references
0.7779738903045654
0 references
0.777664840221405
0 references
0.7660475373268127
0 references