论文信息 - Some factorisations counted by Catalan numbers

Some factorisations counted by Catalan numbers

In this paper, yet another occurrence of the Catalan numbers is presented; it is shown that the number of primitive factorisations of the cyclic permutation (1 2... n + 1) into n transpositions is Cn, the n-th Catalan number. A factorisation ((a1 b1), (a2 b2),..., (an bn)) is primitive if its transpositions are "ordered", in the sense that the ais are non-decreasing.We show that the sequence counting primitive factorisations satisfies the recurrence for Catalan numbers, and we exhibit an explicit bijection between the set of primitive factorisations and the set of 231-avoiding permutations, known to have size counted by Catalan numbers.

Francesca Merola | Daniele A. Gewurz

[1] R. Stanley. What Is Enumerative Combinatorics , 1986 .

[2] Richard P. Stanley,et al. Parking functions and noncrossing partitions , 1996, Electron. J. Comb..

[3] Paul Moszkowski. A Solution to a Problem of Dénes: a Bijection Between Trees and Factorizations of Cyclic Permutations , 1989, Eur. J. Comb..

[4] Dongsu Kim,et al. Transitive cycle factorizations and prime parking functions , 2003, J. Comb. Theory, Ser. A.

[5] Ian P. Goulden,et al. Tree-like Properties of Cycle Factorizations , 2002, J. Comb. Theory, Ser. A.

[6] Philippe Biane. Parking Functions of Types A and B , 2002, Electron. J. Comb..

[7] Philippe Biane,et al. Minimal Factorizations of a Cycle and Central Multiplicative Functions on the Infinite Symmetric Group , 1996, J. Comb. Theory, Ser. A.