Permutations with forbidden subsequences and a generalized Schröder number

Discrete Mathematics

Volumn 218, Issue 1-3, 2000, Pages 121-130

  Kremer, Darla ^a  

^a GETTYSBURG COLLEGE   (United States)

Author keywords

Catalan numbers; Forbidden subsequences; Generating trees; Pattern avoiding permutations; Restricted permutations; Schr der numbers

Indexed keywords

EID: 0001643641     PISSN: 0012365X     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0012-365X(99)00302-7     Document Type: Article

References (20)

1. 4 are Wilf equivalent, Graphs Combin., in press.
2. E. Barcucci, A. Del Lungo, E. Pergola, R. Pinzani, Some permutations with forbidden subsequences and their inversion number, Preprint.
3. M. Bona, Permutations avoiding certain patterns: the case of length 4 and some generalizations, Discrete Math. 175 (1997) 55-67.
4. M. Bona, Exact enumeration of 1342-avoiding permutations: a close link with labeled trees and planar maps, J. Combin. Theory Ser. A 80 (1997) 257-272.
5. F.R.K. Chung, R.L. Graham, V.E Hoggat Jr., M. Kleiman, The number of baxter permutations, J. Combin. Theory Ser. A 24 (1978) 382-394.
6. D.I.A. Cohen, Basic Techniques of Combinatorial Theory, Wiley, Sons/Boston, 1978.
7. D. Foata, D. Zeilberger, A classic proof of a recurrence for a very classical sequence, J. Combin. Theory Ser. A 80 (1997) 380-384.
8. S. Gire, Arbres, permutations à motifs exclus et cartes planaire: quelques problèmes algorithmiques et combinatoires, Ph.D. These, University of Bordeaux, 1993.
9. J.M. Hammersley, Proceedings of the Sixth Berkeley Symposium on Mathematical Statistics and Probability, Vol. 1, University of California Press, Berkeley/Los Angeles, 1972, pp. 345-394.
10. D.E. Knuth, The Art of Computer Programming, Vol. 1, 2nd Edition, Addison-Wesley, Reading, MA 1973.
11. E. Pergola, R.A. Sulanke, Schröder triangles, paths, and parallelogram polyominoes, Preprint.
12. A. Regev, Asymptotic values for degrees associated with strips of young diagrams, Adv. Math. 41 (1981) 115-136.
13. D. Richards, Ballot sequences and restricted permutations, Ars Combin. 25 (1988) 83-86.
14. D.G. Rogers, Discrete Math. 22 (1978) 35-40.
15. R. Simion, F.W. Schmidt, Restricted Permutations, European J. Combin. 6 (1985) 383-406.
16. Z. Stankova, Forbidden Subsequences, Discrete Math. 132 (1994) 291-316.
17. R.A. Sulanke, Three recurrences for parallelogram polyominoes, J. Difference Equations Appl., to appear.
18. J. West, Generating trees and the Catalan and Schröder numbers, Discrete Math. 146 (1995) 247-262.
19. J. West, Generating trees and forbidden subsequences, Discrete Math. 157 (1996) 363-374.
20. J. West, Wilf-equivalence for singleton classes, Preprint.