arXiv Analytics

Sign in

arXiv:1010.5673 [math.CO]AbstractReferencesReviewsResources

Exterior Pairs and Up Step Statistics on Dyck Paths

Sen-Peng Eu, Tung-Shan Fu

Published 2010-10-27Version 1

Let $\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 $\C_n$ is equidistributed with the statistic `number of up steps at height $h$ with $h\equiv 0$ (mod 3)'. Moreover, for $m\ge 3$, we prove that the two statistics `number of up steps at height $h$ with $h\equiv 0$ (mod $m$)' and `number of up steps at height $h$ with $h\equiv m-1$ (mod $m$)' on the set $\C_n$ are `almost equidistributed'. Both results are proved combinatorially.

Comments: 13 pages
Categories: math.CO
Subjects: 05A15, 05A19
Related articles: Most relevant | Search more
arXiv:math/0611698 [math.CO] (Published 2006-11-22)
A bijection on Dyck paths and its cycle structure
arXiv:1705.05984 [math.CO] (Published 2017-05-17)
A bijection between bargraphs and Dyck paths
arXiv:1702.06150 [math.CO] (Published 2017-02-20)
Bijections for Dyck paths with all peak heights of the same parity