2010arXiv (Cornell University)Open access

Exterior Pairs and Up Step Statistics on Dyck Paths

Sen‐Peng Eu, Tung-Shan Fu

Open full text 0 citations

Abstract

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.

Open-access reader

About this research paper

What this paper is about

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.

Why it matters

A significance statement is not available in the OpenAlex record.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

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.

Key concepts: Equidistributed sequence, Mathematics, Combinatorics, Statistic, Set (abstract data type), Automorphism, Statistics, Computer science

Related papers

Back to paper searchBrowse research topicsOriginal source
Exterior Pairs and Up Step Statistics on Dyck Paths — Research Paper | ScholarLens