Doubly alternating Baxter permutations are Catalan

Discrete Mathematics

Volumn 217, Issue 1-3, 2000, Pages 157-166

  Guibert, Olivier ^a   Linusson, Svante ^b  

^a UNIVERSITÉ BORDEAUX 1   (France)

^b STOCKHOLM UNIVERSITY   (Sweden)

Author keywords

Alternating permutation; Baxter permutation; Catalan number; Essential set

Indexed keywords

EID: 0347016861     PISSN: 0012365X     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0012-365X(99)00261-7     Document Type: Article

References (16)

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. S. Dulucq, O. Guibert, Stacks words, standards tableaux and Baxter permutations, Discrete Math. 157 (1996) 91-106.
5. S. Dulucq, O. Guibert, Baxter permutations, Discrete Math. 180 (1998) 143-156.
6. K. Eriksson, S. Linusson, The size of Fulton's essential set, Electron. J. Combin. 2 (1995) R6.
7. K. Eriksson, S. Linusson, Combinatorics of Fulton's essential set, Duke Math. J. 85 (1) (1996) 61-76.
8. A. Errera, Un problème d'énumération, Mémoires publiées par l'Académie royale de Belgique Bruxelles, Vol. 11, 1931.
9. W. Fulton, Flags, Schubert polynomials, degeneracy loci, and determinantal formulas, Duke Math. J. 65 (1992) 381-420.
10. S. Gire, Arbres, permutations à motifs exclus et cartes planaires: quelques problèmes algorithmiques et combinatoires, Ph.D. Thesis, University of Bordeaux I, 1993.
11. O. Guibert, Combinatoire des permutations à motifs exclus en liaison avec mots, cartes planaires et tableaux de Young, Ph.D. Thesis, University of Bordeaux I, 1995.
12. D.E. Knuth, The Art of Computer Programming, Fundamental Algorithms, Vol. 1, Addison-Wesley, Reading, MA, 1973.
13. C.L. Mallows, Baxter permutations rise again, J. Combin. Theory Ser. A 27 (1979) 394-396.
14. R. Simion, F.W. Schmidt, Restricted permutations, European J. Combin. 6 (1985) 383-406.
15. G. Viennot, A bijective proof for the number of Baxter permutations, Séminaire Lotharingien de Combinatoire, Le Klebach, 1981.
16. J. West, Permutations with forbidden subsequences and stack-sortable permutations, Ph.D. Thesis, MIT, Cambridge, MA, 1990.