Baxter permutations

Discrete Mathematics

Volumn 180, Issue 1-3, 1998, Pages 143-156

  Dulucq, S ^a   Guibert, O ^a  

^a UNIVERSITÉ BORDEAUX 1   (France)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0000774781     PISSN: 0012365X     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0012-365X(97)00112-X     Document Type: Article

References (13)

1. G. Baxter, On fixed points of the composite of commuting functions, Proc. Amer. Math. Soc. 15 (1964) 851-855.
2. F.R.K. Chung, R.L. Graham, V.E. Hoggatt, M. Kleiman, The number of Baxter permutations, J. Combin. Theory Ser. A 24 (1978) 382-394.
3. R. Cori, S. Dulucq, G. Viennot, Shuffle of parenthesis systems and Baxter permutations, J. Combin. Theory Ser. A 43 (1986) 1-22.
4. M. Delest, X. Viennot, Algebraic languages and polyominoes enumeration, Theor. Comput. Sci. 34 (1984) 169-206.
5. S. Dulucq, O. Guibert, Mots de piles, tableaux standards et permutations de Baxter, 6th Formal Power Series and Algebraic Combinatorics Conf., Dimacs, 1994, Discrete Math., to appear.
6. F. Françon, X. Viennot, Permutations selon les pics, creux, doubles-montées, doubles-descentes, nombres d'Euler et de Genocchi, Discrete Math. 28 (1979) 21-35.
7. I.M. Gessel, G. Viennot, Binomial determinants, paths, and hook length formulae, Adv. Math. 58 (1985) 300-321.
8. S. Gire, Arbres, permutations à motifs exclus et cartes planaires: quelques problèmes algorithmiques et combinatoires, Bordeaux I University Thesis, 1993.
9. G. Kreweras, Sur les éventails de segments, Cahiers Bureau Univ. Rech. Opér. 15 (1970) 1-41.
10. C.L. Mallows, Baxter permutations rise again, J. Combin. Theory Ser. A 27 (1979) 394-396.
11. R.C. Mullin, The enumeration of hamiltonian polygons in triangular maps, Pacific J. Math. 16 (1966) 139-145.
12. G. Viennot, A bijective proof for the number of Baxter permutations, Séminaire Lotharingien de Combinatoire, Le Klebach, 1981.
13. J. West, Sorting twice through a stack, 3rd Formal Power Series and Algebraic Combinatorics Conf., Bordeaux, Theoret. Comput. Sci. 117 (1993) 303-313.