Annular noncrossing permutations and minimal transitive factorizations

Jang Soo Kim; Seunghyun Seo; Heesung Shin

doi:10.1016/j.jcta.2014.02.005

Annular noncrossing permutations and minimal transitive factorizations

Jang Soo Kim
, Seunghyun Seo
, Heesung Shin

Department of Mathematics

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

2 Scopus citations

Abstract

We give a combinatorial proof of Goulden and Jackson's formula for the number of minimal transitive factorizations of a permutation when the permutation has two cycles. We use the recent result of Goulden, Nica, and Oancea on the number of maximal chains of annular noncrossing partitions of type B.

Original language	English
Pages (from-to)	251-262
Number of pages	12
Journal	Journal of Combinatorial Theory. Series A
Volume	124
Issue number	1
DOIs	https://doi.org/10.1016/j.jcta.2014.02.005
State	Published - May 2014

Keywords

Annular noncrossing permutation
Combinatorial proof
Minimal transitive factorization

Access to Document

10.1016/j.jcta.2014.02.005

Cite this

@article{4318beaeb6cc46f3aa9e96c2bd3848b0,

title = "Annular noncrossing permutations and minimal transitive factorizations",

abstract = "We give a combinatorial proof of Goulden and Jackson's formula for the number of minimal transitive factorizations of a permutation when the permutation has two cycles. We use the recent result of Goulden, Nica, and Oancea on the number of maximal chains of annular noncrossing partitions of type B.",

keywords = "Annular noncrossing permutation, Combinatorial proof, Minimal transitive factorization",

author = "Kim, \{Jang Soo\} and Seunghyun Seo and Heesung Shin",

year = "2014",

month = may,

doi = "10.1016/j.jcta.2014.02.005",

language = "English",

volume = "124",

pages = "251--262",

journal = "Journal of Combinatorial Theory. Series A",

issn = "0097-3165",

publisher = "Academic Press Inc.",

number = "1",

}

TY - JOUR

T1 - Annular noncrossing permutations and minimal transitive factorizations

AU - Kim, Jang Soo

AU - Seo, Seunghyun

AU - Shin, Heesung

PY - 2014/5

Y1 - 2014/5

N2 - We give a combinatorial proof of Goulden and Jackson's formula for the number of minimal transitive factorizations of a permutation when the permutation has two cycles. We use the recent result of Goulden, Nica, and Oancea on the number of maximal chains of annular noncrossing partitions of type B.

AB - We give a combinatorial proof of Goulden and Jackson's formula for the number of minimal transitive factorizations of a permutation when the permutation has two cycles. We use the recent result of Goulden, Nica, and Oancea on the number of maximal chains of annular noncrossing partitions of type B.

KW - Annular noncrossing permutation

KW - Combinatorial proof

KW - Minimal transitive factorization

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

U2 - 10.1016/j.jcta.2014.02.005

DO - 10.1016/j.jcta.2014.02.005

M3 - Article

AN - SCOPUS:84897656268

SN - 0097-3165

VL - 124

SP - 251

EP - 262

JO - Journal of Combinatorial Theory. Series A

JF - Journal of Combinatorial Theory. Series A

IS - 1

ER -

Annular noncrossing permutations and minimal transitive factorizations

Abstract

Keywords

Access to Document

Other files and links

Fingerprint

Cite this