Exterior pairs and up step statistics on Dyck paths

Sen-Peng Eu, Tung Shan Fu

Research output: Contribution to journalArticle

Abstract

Let Cn be the set of Dyck paths of length n. In this paper, by a new auto- morphism of ordered trees, we prove that the statistic 'number of exterior pairs', introduced by A. Denise and R. Simion, on the set Cn is equidistributed with the statistic 'number of up steps at height h with h ≡ 0 (mod 3)'. Moreover, for m ≥ 3, we prove that the two statistics 'number of up steps at height h with h ≡ 0 (mod m)' and 'number of up steps at height h with h ≡ m - 1 (mod m)' on the set Cn are 'almost equidistributed'. Both results are proved combinatorially.

Original languageEnglish
JournalElectronic Journal of Combinatorics
Volume18
Issue number1
Publication statusPublished - 2011 May 12

Fingerprint

Dyck Paths
Statistics
Statistic
Ordered Trees
Automorphism

Keywords

  • Continued fraction
  • Dyck path
  • Exterior pair
  • Ordered tree
  • Planted tree

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Geometry and Topology
  • Discrete Mathematics and Combinatorics
  • Computational Theory and Mathematics
  • Applied Mathematics

Cite this

Exterior pairs and up step statistics on Dyck paths. / Eu, Sen-Peng; Fu, Tung Shan.

In: Electronic Journal of Combinatorics, Vol. 18, No. 1, 12.05.2011.

Research output: Contribution to journalArticle

@article{9c2c705e3812459a9732afbc0ce2d46d,
title = "Exterior pairs and up step statistics on Dyck paths",
abstract = "Let Cn be the set of Dyck paths of length n. In this paper, by a new auto- morphism of ordered trees, we prove that the statistic 'number of exterior pairs', introduced by A. Denise and R. Simion, on the set Cn is equidistributed with the statistic 'number of up steps at height h with h ≡ 0 (mod 3)'. Moreover, for m ≥ 3, we prove that the two statistics 'number of up steps at height h with h ≡ 0 (mod m)' and 'number of up steps at height h with h ≡ m - 1 (mod m)' on the set Cn are 'almost equidistributed'. Both results are proved combinatorially.",
keywords = "Continued fraction, Dyck path, Exterior pair, Ordered tree, Planted tree",
author = "Sen-Peng Eu and Fu, {Tung Shan}",
year = "2011",
month = "5",
day = "12",
language = "English",
volume = "18",
journal = "Electronic Journal of Combinatorics",
issn = "1077-8926",
publisher = "Electronic Journal of Combinatorics",
number = "1",

}

TY - JOUR

T1 - Exterior pairs and up step statistics on Dyck paths

AU - Eu, Sen-Peng

AU - Fu, Tung Shan

PY - 2011/5/12

Y1 - 2011/5/12

N2 - Let Cn be the set of Dyck paths of length n. In this paper, by a new auto- morphism of ordered trees, we prove that the statistic 'number of exterior pairs', introduced by A. Denise and R. Simion, on the set Cn is equidistributed with the statistic 'number of up steps at height h with h ≡ 0 (mod 3)'. Moreover, for m ≥ 3, we prove that the two statistics 'number of up steps at height h with h ≡ 0 (mod m)' and 'number of up steps at height h with h ≡ m - 1 (mod m)' on the set Cn are 'almost equidistributed'. Both results are proved combinatorially.

AB - Let Cn be the set of Dyck paths of length n. In this paper, by a new auto- morphism of ordered trees, we prove that the statistic 'number of exterior pairs', introduced by A. Denise and R. Simion, on the set Cn is equidistributed with the statistic 'number of up steps at height h with h ≡ 0 (mod 3)'. Moreover, for m ≥ 3, we prove that the two statistics 'number of up steps at height h with h ≡ 0 (mod m)' and 'number of up steps at height h with h ≡ m - 1 (mod m)' on the set Cn are 'almost equidistributed'. Both results are proved combinatorially.

KW - Continued fraction

KW - Dyck path

KW - Exterior pair

KW - Ordered tree

KW - Planted tree

UR - http://www.scopus.com/inward/record.url?scp=79955734150&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=79955734150&partnerID=8YFLogxK

M3 - Article

AN - SCOPUS:79955734150

VL - 18

JO - Electronic Journal of Combinatorics

JF - Electronic Journal of Combinatorics

SN - 1077-8926

IS - 1

ER -