The enumeration of permutations with a prescribed number of "forbidden" patterns

Advances in Applied Mathematics

Volumn 17, Issue 4, 1996, Pages 381-407

  Noonan, John ^a   Zeilberger, Doron ^a  

^a Temple University   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0030527058     PISSN: 01968858     EISSN: None     Source Type: Journal    
DOI: 10.1006/aama.1996.0016     Document Type: Article

References (10)

1. 1. K. Erikson and S. Linusson, The size of Fulton's essential set, Electron. J. Combin. 1, R6 (1995).
2. 2. V. E. Hoggatt Jr. and M. Bicknell, Catalan and related sequences arising from inverses of Pascal's triangle matrices, Fibonacci Quart. 14 (1976), 395-404.
3. 3. D. Knuth, "The Art of Computer Programming, Vol. 3, Sorting and Searching," Addison-Wesley, Reading, MA, 1973.
4. 4. J. Noonan, The number of permutations containing exactly one increasing subsequence of length three, Discrete Math., to appear.
5. 5. B. Salvy and P. Zimmermann, Gfun: a Maple package for the manipulation of generating and holonomic functions in one variable, ACM Trans. Math. Software 20 (1994).
6. 6. R. Simion and F. W. Schmidt, Restricted permutations, European J. Combin. 6 (1985), 383-406.
7. 7. J. West, "Permutations with Forbidden Subsequences and Stack Sortable Permutations," Ph.D. thesis, MIT, 1990.
8. 8. D. Zeilberger, A Holonomic systems approach to special functions identities, J. Comput. Appl. Math. 32 (1990), 321-368.
9. 9. D. Zeilberger, "The Joy of Brute Force," available via world wide web browser at http://www.math.temple.edu/~zeilberg/papers1 .html.
10. 10. D. Zeilberger, "SCHUTZENBERGER, a Package for Maple," available via world wide web browser at http://www.math.temple.edu/~zeilberg/programs.html.