Counting segmented permutations using bicoloured Dyck paths

Anders Claesson

Research output: Contribution to journalArticle

Abstract

A bicoloured Dyck path is a Dyck path in which each up-step is assigned one of two colours, say, red and green. We say that a permutation π is σ-segmented if every occurrence o of σ in π is a segment-occurrence (i.e., o is a contiguous subword in π).

We show combinatorially the following two results: The 132-segmented permutations of length n with k occurrences of 132 are in one-to-one correspondence with bicoloured Dyck paths of length 2n−4k with k red up-steps. Similarly, the 123-segmented permutations of length n with k occurrences of 123 are in one-to-one correspondence with bicoloured Dyck paths of length 2n−4k with k red up-steps, each of height less than 2.

We enumerate the permutations above by enumerating the corresponding bicoloured Dyck paths. More generally, we present a bivariate generating function for the number of bicoloured Dyck paths of length 2n with k red up-steps, each of height less than h. This generating function is expressed in terms of Chebyshev polynomials of the second kind.
LanguageEnglish
Article numberR39
Number of pages18
JournalThe Electronic Journal of Combinatorics
Volume12
Publication statusPublished - 17 Aug 2005

Fingerprint

Dyck Paths
Counting
Permutation
Polynomials
One to one correspondence
Color
Generating Function
Subword
Chebyshev Polynomials

Keywords

  • bicoloured Dyck path
  • Dyck path
  • segmented permutations

Cite this

@article{48a66a21ea524e6d935815787c64dfa2,
title = "Counting segmented permutations using bicoloured Dyck paths",
abstract = "A bicoloured Dyck path is a Dyck path in which each up-step is assigned one of two colours, say, red and green. We say that a permutation π is σ-segmented if every occurrence o of σ in π is a segment-occurrence (i.e., o is a contiguous subword in π).We show combinatorially the following two results: The 132-segmented permutations of length n with k occurrences of 132 are in one-to-one correspondence with bicoloured Dyck paths of length 2n−4k with k red up-steps. Similarly, the 123-segmented permutations of length n with k occurrences of 123 are in one-to-one correspondence with bicoloured Dyck paths of length 2n−4k with k red up-steps, each of height less than 2.We enumerate the permutations above by enumerating the corresponding bicoloured Dyck paths. More generally, we present a bivariate generating function for the number of bicoloured Dyck paths of length 2n with k red up-steps, each of height less than h. This generating function is expressed in terms of Chebyshev polynomials of the second kind.",
keywords = "bicoloured Dyck path, Dyck path, segmented permutations",
author = "Anders Claesson",
year = "2005",
month = "8",
day = "17",
language = "English",
volume = "12",
journal = "The Electronic Journal of Combinatorics",
issn = "1077-8926",

}

Counting segmented permutations using bicoloured Dyck paths. / Claesson, Anders.

In: The Electronic Journal of Combinatorics, Vol. 12, R39, 17.08.2005.

Research output: Contribution to journalArticle

TY - JOUR

T1 - Counting segmented permutations using bicoloured Dyck paths

AU - Claesson, Anders

PY - 2005/8/17

Y1 - 2005/8/17

N2 - A bicoloured Dyck path is a Dyck path in which each up-step is assigned one of two colours, say, red and green. We say that a permutation π is σ-segmented if every occurrence o of σ in π is a segment-occurrence (i.e., o is a contiguous subword in π).We show combinatorially the following two results: The 132-segmented permutations of length n with k occurrences of 132 are in one-to-one correspondence with bicoloured Dyck paths of length 2n−4k with k red up-steps. Similarly, the 123-segmented permutations of length n with k occurrences of 123 are in one-to-one correspondence with bicoloured Dyck paths of length 2n−4k with k red up-steps, each of height less than 2.We enumerate the permutations above by enumerating the corresponding bicoloured Dyck paths. More generally, we present a bivariate generating function for the number of bicoloured Dyck paths of length 2n with k red up-steps, each of height less than h. This generating function is expressed in terms of Chebyshev polynomials of the second kind.

AB - A bicoloured Dyck path is a Dyck path in which each up-step is assigned one of two colours, say, red and green. We say that a permutation π is σ-segmented if every occurrence o of σ in π is a segment-occurrence (i.e., o is a contiguous subword in π).We show combinatorially the following two results: The 132-segmented permutations of length n with k occurrences of 132 are in one-to-one correspondence with bicoloured Dyck paths of length 2n−4k with k red up-steps. Similarly, the 123-segmented permutations of length n with k occurrences of 123 are in one-to-one correspondence with bicoloured Dyck paths of length 2n−4k with k red up-steps, each of height less than 2.We enumerate the permutations above by enumerating the corresponding bicoloured Dyck paths. More generally, we present a bivariate generating function for the number of bicoloured Dyck paths of length 2n with k red up-steps, each of height less than h. This generating function is expressed in terms of Chebyshev polynomials of the second kind.

KW - bicoloured Dyck path

KW - Dyck path

KW - segmented permutations

UR - http://www.combinatorics.org/ojs/index.php/eljc/article/view/v12i1r39

M3 - Article

VL - 12

JO - The Electronic Journal of Combinatorics

T2 - The Electronic Journal of Combinatorics

JF - The Electronic Journal of Combinatorics

SN - 1077-8926

M1 - R39

ER -