Minimal transitive factorizations of a permutation of type (p, q)

Jang Soo Kim; Seunghyun Seo; Heesung Shin

Minimal transitive factorizations of a permutation of type (p, q)

Jang Soo Kim
, Seunghyun Seo
, Heesung Shin

University of Minnesota Twin Cities
Kangwon National University
Inha University

Research output: Contribution to journal › Conference article › peer-review

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)	673-682
Number of pages	10
Journal	Discrete Mathematics and Theoretical Computer Science
State	Published - 2012
Externally published	Yes
Event	24th International Conference on Formal Power Series and Algebraic Combinatorics, FPSAC 2012 - Nagoya, Japan Duration: 30 Jul 2012 → 3 Aug 2012

Keywords

Annular noncrossing partitions
Bijective proof
Minimal transitive factorizations

Cite this

@article{e2a0beae49284306b49b64a54aa9320a,

title = "Minimal transitive factorizations of a permutation of type (p, q)",

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 partitions, Bijective proof, Minimal transitive factorizations",

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

year = "2012",

language = "English",

pages = "673--682",

journal = "Discrete Mathematics and Theoretical Computer Science",

issn = "1462-7264",

publisher = "Maison de l'informatique et des mathematiques discretes",

note = "24th International Conference on Formal Power Series and Algebraic Combinatorics, FPSAC 2012 ; Conference date: 30-07-2012 Through 03-08-2012",

}

TY - JOUR

T1 - Minimal transitive factorizations of a permutation of type (p, q)

AU - Kim, Jang Soo

AU - Seo, Seunghyun

AU - Shin, Heesung

PY - 2012

Y1 - 2012

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 partitions

KW - Bijective proof

KW - Minimal transitive factorizations

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

M3 - Conference article

AN - SCOPUS:84887524419

SN - 1462-7264

SP - 673

EP - 682

JO - Discrete Mathematics and Theoretical Computer Science

JF - Discrete Mathematics and Theoretical Computer Science

T2 - 24th International Conference on Formal Power Series and Algebraic Combinatorics, FPSAC 2012

Y2 - 30 July 2012 through 3 August 2012

ER -

Minimal transitive factorizations of a permutation of type (p, q)

Abstract

Keywords

Other files and links

Fingerprint

Cite this