A combinatorial proof of J. West's conjecture

Discrete Mathematics

Volumn 187, Issue 1-3, 1998, Pages 71-96

  Dulucq, S ^a   Gire, S ^a   Guibert, O ^a  

^a UNIVERSITÉ BORDEAUX 1   (France)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0008981557     PISSN: 0012365X     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0012-365X(98)80005-8     Document Type: Article

References (27)

1. S. Billey, W. Jockusch, R.P. Stanley, Some combinatorial properties of Schubert polynomials, J. Algebraic Combin. 2 (1993) 345-374.
2. W.G. Brown, Enumeration of non-separable planar maps, Can. J. Math. 15 (1963) 526-545.
3. W.G. Brown, W.T. Tutte, On the enumeration of rooted non-separable planar maps, Can. J. Math. 16 (1964) 572-577.
4. 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.
5. R. Cori, Un code pour les graphes planaires et ses applications, Astérisque, Société Mathématique de France 27 (1975).
6. R. Cori, B. Vauquelin, Planar maps are well labeled trees, Can. J. Math. 33 (1981) 1023-1042.
7. S. Dulucq, S. Gire, J. West, Permutations with forbidden subsequences and nonseparable planar maps, 5th Conf. on Formal Power Series and Algebraic Combinatorics Florence, 1993, pp. 165-178; Discrete Mathematics 153 (1996) 85-103.
8. S. Dulucq, S. Gire, J. West, Permutations with forbidden subsequences and nonseparable planar maps, 5th Conf. on Formal Power Series and Algebraic Combinatorics Florence, 1993, pp. 165-178; Discrete Mathematics 153 (1996) 85-103.
9. S. Gire, Arbres, permutations à motifs exclus et cartes planaires: quelques problèmes algorithmiques et combinatoires, Thèse de l'Université Bordeaux I (Ph.D. Thesis) 1993.
10. I.P. Goulden, J. West, Raney paths and a combinatorial relationship between rooted nonseparable planar maps and two-stack-sortable permutations, preprint.
11. O. Guibert, Permutations sans sous-séquence interdite, Mémoire de D.E.A. de l'Université Bordeaux I (Master's Thesis) 1992.
12. O. Guibert, Combinatoire des permutations à motifs exclus en liaison avec mots, cartes planaires et tableaux de Young, Thèse de l'Université Bordeaux I (Ph.D. Thesis) 1995.
13. M.D. Haiman, Noncommutative rational power series and algebraic generating functions, European J. Combin. 14 (1993) 335-339.
14. D.E. Knuth, The art of Computer Programming, I: Fundamental Algorithms, Addison-Wesley, Reading, MA, 1973, pp. 238-239.
15. A. Regev, Asymptotic values for degrees associated with strips of Young diagrams, Adv. Math. 41 (1981) 115-136.
16. D. Rotem, Stack sortable permutations, Discrete Math. 33 (1981) 185-196.
17. R. Simion, F.W. Schmidt, Restricted permutations, European J. Combin. 6 (1985) 383-406.
18. Z.E. Stankova, Forbidden subsequences, Discrete Math. 132 (1994) 291-316.
19. W.T. Tutte, A census of planar maps, Can. J. Math. 15 (1963) 249-271.
20. W.T. Tutte, On the enumeration of planar maps, Bull. Amer. Math. Soc. 74 (1968) 64-74.
21. J. West, Permutations with forbidden subsequences and stack-sortable permutations, Ph.D. Thesis, The Massachusetts Institute of Technology, Cambridge, MA, 1990.
22. J. West, Sorting twice through a stack, 3rd Conf. on Formal Power Series and Algebraic Combinatorics, Bordeaux, 1991, pp. 397-406, Theorical Comput. Sci. 117 (1993) 303-313.
23. J. West, Sorting twice through a stack, 3rd Conf. on Formal Power Series and Algebraic Combinatorics, Bordeaux, 1991, pp. 397-406, Theorical Comput. Sci. 117 (1993) 303-313.
24. J. West, Generating trees and the Catalan and Schröder numbers, Discrete Math. 146 (1995) 247-262.
25. J. West, Generating trees and forbidden subsequences, 6th Conf. on Formal Power Series and Algebraic Combinatorics, Dimacs, 1994, pp. 441-450; Discrete Math. 157 (1996) 363-374.
26. J. West, Generating trees and forbidden subsequences, 6th Conf. on Formal Power Series and Algebraic Combinatorics, Dimacs, 1994, pp. 441-450; Discrete Math. 157 (1996) 363-374.
27. D. Zeilberger, A proof of Julian West's conjecture that the number of two-stack sortable permutations of length n is 2(3n)!/((n + 1)!(2n + 1)!), Discrete Math. 102 (1992) 85-93.