论文信息 - Shuffle of parenthesis systems and baxter permutations

Shuffle of parenthesis systems and baxter permutations

Abstract A formula for the number alternating Baxter permutations is given. The proof of this formula is given by constructing bijection between permutations, trees, and words. This gives also a combinatorial proof of a formula appearing in the enumerative theory of planar maps.

Robert Cori | Gérard Viennot | Serge Dulucq

[1] Ronald C. Mullin. The enumeration of Hamiltonian polygons in triangular maps. , 1966 .

[2] Désiré André,et al. Sur les permutations alternées , 1881 .

[3] W. T. Tutte. A Census of Hamiltonian Polygons , 1962, Canadian Journal of Mathematics.

[4] Fan Chung Graham,et al. The Number of Baxter Permutations , 1978, J. Comb. Theory, Ser. A.

[5] C.L Mallows,et al. Baxter Permutations Rise Again , 1979, J. Comb. Theory, Ser. A.

[6] Jean Françon. Arbres Binaires de Recherche: Propriétés Combinatioires et Applications , 1976, RAIRO Theor. Informatics Appl..

[7] D. Foata. CHAPTER 16 – Nombres d'Euler et Permutations Alternantes , 1973 .

[8] Dominique Foata,et al. Rearrangements of the symmetric group and enumerative properties of the tangent and secant numbers , 1974 .

[9] G. Baxter,et al. On fixed points of the composite of commuting functions , 1964 .