Consecutive patterns in permutations

Advances in Applied Mathematics

Volumn 30, Issue 1-2, 2003, Pages 110-125

  Elizalde, Sergi ^a   Noy, Marc ^b  

^a MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

^b UNIVERSITAT POLITÈCNICA DE CATALUNYA   (Spain)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0037728818     PISSN: 01968858     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0196-8858(02)00527-4     Document Type: Review

References (13)

1. E. Babson, E. Steingrímsson, Generalized permutation patterns and a classification of the Mahonian statistics, Sém. Lothar. Combin. B 44b (2000) 18.
2. L. Carlitz, R. Scoville, Enumeration of permutations by rises, falls, rising maxima and falling maxima, Acta Math. Sci. Hungar. 25 (1974) 269-277.
3. A. Claesson, Generalised pattern avoidance, European J. Combin. 22 (2001) 961-971.
4. L. Comtet, Advanced Combinatorics, Reidel, 1974.
5. L. Devroye, Limit laws for local counters in random binary search trees, Random Structures Algorithms 2 (1991) 303-315.
6. P. Flajolet, X. Gourdon, C. Martínez, Patterns in random binary search trees, Random Structures Algorithms 11 (1997) 223-244.
7. P. Flajolet, M. Noy, Analytic combinatorics of non-crossing configurations, Discrete Math. 204 (1999) 203-229.
8. P. Flajolet, R. Sedgewick, Analytic Combinatorics, 1998, book in preparation, Individual chapters are available as INRIA, Research Reports 1888, 2026, 2376, 2956, 3162.
9. I.P. Goulden, D.M. Jackson, Combinatorial Enumeration, Wiley, 1983.
10. S. Kitaev, Multi-avoidance of generalised patterns, Discrete Math., to appear.
11. R. Sedgewick, P. Flajolet, An Introduction to the Analysis of Algorithms, Addison-Wesley, 1996.
12. R. Simion, F.W. Schmidt, Restricted Permutations, European J. Combin. 6 (1985) 383-406.
13. R. Stanley, Enumerative Combinatorics, Vol. I, Cambridge Univ. Press, Cambridge, 1997.