Enumeration of (k, 2)-noncrossing partitions

Toufik Mansour; Simone Severini

doi:10.1016/j.disc.2007.08.068

Enumeration of (k, 2)-noncrossing partitions

Toufik Mansour, Simone Severini

Department of Mathematics

Research output: Contribution to journal › Article › peer-review

Abstract

A set partition is said to be (k, d)-noncrossing if it avoids the pattern 12 ⋯ k 12 ⋯ d. We find an explicit formula for the ordinary generating function of the number of (k, d)-noncrossing partitions of { 1, 2, ..., n } when d = 1, 2.

Original language	English
Pages (from-to)	4570-4577
Number of pages	8
Journal	Discrete Mathematics
Volume	308
Issue number	20
DOIs	https://doi.org/10.1016/j.disc.2007.08.068
State	Published - 28 Oct 2008

Keywords

Forbidden subsequences
Kernel method
Partitions

ASJC Scopus subject areas

Theoretical Computer Science
Discrete Mathematics and Combinatorics

Access to Document

10.1016/j.disc.2007.08.068

Cite this

@article{a4efcfee0c1d46de8a7642d5d5f9021a,

title = "Enumeration of (k, 2)-noncrossing partitions",

abstract = "A set partition is said to be (k, d)-noncrossing if it avoids the pattern 12 ⋯ k 12 ⋯ d. We find an explicit formula for the ordinary generating function of the number of (k, d)-noncrossing partitions of \{ 1, 2, ..., n \} when d = 1, 2.",

keywords = "Forbidden subsequences, Kernel method, Partitions",

author = "Toufik Mansour and Simone Severini",

year = "2008",

month = oct,

day = "28",

doi = "10.1016/j.disc.2007.08.068",

language = "English",

volume = "308",

pages = "4570--4577",

journal = "Discrete Mathematics",

issn = "0012-365X",

publisher = "Elsevier",

number = "20",

}

TY - JOUR

T1 - Enumeration of (k, 2)-noncrossing partitions

AU - Mansour, Toufik

AU - Severini, Simone

PY - 2008/10/28

Y1 - 2008/10/28

N2 - A set partition is said to be (k, d)-noncrossing if it avoids the pattern 12 ⋯ k 12 ⋯ d. We find an explicit formula for the ordinary generating function of the number of (k, d)-noncrossing partitions of { 1, 2, ..., n } when d = 1, 2.

AB - A set partition is said to be (k, d)-noncrossing if it avoids the pattern 12 ⋯ k 12 ⋯ d. We find an explicit formula for the ordinary generating function of the number of (k, d)-noncrossing partitions of { 1, 2, ..., n } when d = 1, 2.

KW - Forbidden subsequences

KW - Kernel method

KW - Partitions

UR - https://www.scopus.com/pages/publications/48449099794

U2 - 10.1016/j.disc.2007.08.068

DO - 10.1016/j.disc.2007.08.068

M3 - Article

AN - SCOPUS:48449099794

SN - 0012-365X

VL - 308

SP - 4570

EP - 4577

JO - Discrete Mathematics

JF - Discrete Mathematics

IS - 20

ER -

Enumeration of (k, 2)-noncrossing partitions

Abstract

Keywords

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this