Generalized Pattern Avoidance

European Journal of Combinatorics

Volumn 22, Issue 7, 2001, Pages 961-971

  Claesson, Anders ^a  

^a CHALMERS UNIVERSITY OF TECHNOLOGY   (Sweden)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0035642626     PISSN: 01956698     EISSN: None     Source Type: Journal    
DOI: 10.1006/eujc.2001.0515     Document Type: Article

References (8)

1. E. Babson and E. Steingrímsson, Generalized permutation patterns and a classification of the Mahonian statistics, Sémin. Lotharingien Comb., B44b (2000), 18.
2. E. Deutsch, Dyck path enumeration, Discrete Math., 204 (1999), 167-202.
3. P. Flajolet and R. Schott, Non-overlapping partitions, continued fractions, Bessel functions and a divergent series, Europ. J. Combinatorics, 11 (1990), 421-432.
4. D. E. Knuth, The Art of Computer Programming, Addison-Wesley, Reading, 1973.
5. R. Simion and F. W. Schmidt, Restricted permutations, Europ. J. Combinatorics, 6 (1985), 383-406.
6. N. J. A. Sloane and S. Plouffe, The Encyclopedia of Integer Sequences, Academic Press, San Diego, 1995, http://www.research.att.com/~njas/sequences/.
7. R. P. Stanley, Enumerative Combinatorics, Cambridge University Press, Cambridge, 1997.
8. J. West, Generating trees and the Catalan and Schröder numbers, Discrete Math., 146 (1995), 247-262.