Exterior pairs and up step statistics on Dyck paths (Q540090): Difference between revisions
From MaRDI portal
Created a new Item |
Changed an Item |
||
(3 intermediate revisions by 3 users not shown) | |||
Property / review text | |||
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. | |||
Property / review text: 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. / rank | |||
Normal rank | |||
Property / Mathematics Subject Classification ID | |||
Property / Mathematics Subject Classification ID: 05A15 / rank | |||
Normal rank | |||
Property / Mathematics Subject Classification ID | |||
Property / Mathematics Subject Classification ID: 05A19 / rank | |||
Normal rank | |||
Property / zbMATH DE Number | |||
Property / zbMATH DE Number: 5903022 / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
Dyck path | |||
Property / zbMATH Keywords: Dyck path / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
exterior pair | |||
Property / zbMATH Keywords: exterior pair / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
ordered tree | |||
Property / zbMATH Keywords: ordered tree / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
planted tree | |||
Property / zbMATH Keywords: planted tree / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
continued fraction | |||
Property / zbMATH Keywords: continued fraction / rank | |||
Normal rank | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Property / arXiv ID | |||
Property / arXiv ID: 1010.5673 / rank | |||
Normal rank | |||
links / mardi / name | links / mardi / name | ||
Latest revision as of 15:09, 18 April 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Exterior pairs and up step statistics on Dyck paths |
scientific article |
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