Sorted and/or sortable permutations

Discrete Mathematics

Volumn 225, Issue 1-3, 2000, Pages 25-50

  Bousquet Mélou, Mireille ^a  

^a UNIVERSITÉ BORDEAUX 1   (France)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0345754789     PISSN: 0012365X     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0012-365X(00)00146-1     Document Type: Article

References (23)

1. E. Barcucci, A. Del Lungo, S. Lanini, M. Macri, R. Pinzani, The inversion number of some permutations with forbidden subsequences, Proceedings of SOCA'96, Tianjin, 1996, pp. 21-32.
2. F. Bergeron, C. Reutenauer, Combinatorial resolution of systems of differential equations III: a special class of differentially algebraic series, European J. Combin. 11 (1990) 501-512.
3. M. Bousquet-Mélou, A method for the enumeration of various classes of column-convex polygons, Discrete Math. 154 (1996) 1-25.
4. M. Bousquet-Mélou, Multi-statistic enumeration of two-stack sortable permutations, Electron. J. Combin. 5 (1998) R21.
5. W.G. Brown, Enumeration of non-separable planar maps, Canad. J. Math. 15 (1963) 526-545.
6. W.G. Brown, On the existence of square roots in certain rings of power series, Math. Annalen 158 (1965) 82-89.
7. W.G. Brown, W.T. Tutte, On the enumeration of rooted non-seperable planar maps, Canad. J. Math. 16 (1964) 572-577.
8. R. Cori, B. Jacquard, G. Schaeffer, Description trees for some families of planar maps, Proceedings of the ninth Conference on Formal Power Series and Algebraic Combinatorics, Vienna, 1997, pp. 196-208.
9. R. Cori, J. Richard, Énumération des graphes planaires à l'aide des séries formelles en variables non commutatives, Discrete Math. 2 (2) (1972) 115-162.
10. S. Dulucq, S. Gire, O. Guibert, A combinatorial proof of J. West's conjecture, Discrete Math. 187 (1998) 71-96.
11. S. Feretić, D. Svrtan, On the number of column-convex polyominoes with given perimeter and number of columns, in: A. Barlotti, M. Delest, R. Pinzani (Eds.), Proceedings of the fifth conference on Formal Power Series and Algebraic Combinatorics, Florence, June 1993, pp. 201-214.
12. I.P. Goulden, D.M. Jackson, Combinatorial Enumeration, Wiley, New York, 1983.
13. I.P. Goulden, J. West, Raney paths and a combinatorial relationship between rooted non-separable planar maps and two-stack-sortable permutations, J. Combin. Theory Ser. A 75 (1996) 220-242.
14. D.E. Knuth, The Art of Computer Programming, Vol. 1, Fundamental Algorithms, Addison-Wesley, Reading, MA, 1973.
15. M. Petkovšek, H.S. Wilf, D. Zeilberger, A = B, A.K. Peters, Wellesley, MA, 1996.
16. D. Rawlings, The ABC's of classical enumeration, Ann. Sci. Math. Québec 10 (2) (1986) 207-235.
17. D. Rawlings, The Euler-Catalan identity, European J. Combin. 9 (1988) 53-60.
18. B. Salvy, P. Zimmermann, GFUN: a MAPLE package for the manipulation of generating and holonomic functions in one variable, ACM Trans. Math. Software 20 (1994) 163-167.
19. R.P. Stanley, Differentiably finite power series, European J. Combin. 1 (1980) 175-188.
20. W.T. Tutte, On the enumeration of planar maps, Bull. Amer. Math. Soc. 74 (1968) 64-74.
21. J. West, Permutations with restricted subsequences and stack-sortable permutations, Ph.D. Thesis, MIT, 1990.
22. J. West, Sorting twice through a stack, Theoret. Comput. Sci. 117 (1993) 303-313.
23. 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.