Abstract
The notion of Enumeration Scheme is introduced and applied to the problem of counting permutations with forbidden patterns. Most importantly, the process is completely automated in a software package, WILF, accompanying this article.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
D. E. Knuth, The Art of Computer Programming, Vol. 3, Addison-Wesley, Reading, MA, 1973; 2nd Edition, 1997.
L. B. Gerson, Sefer Ma'asei Khosev, 1321, Orange, France. [Extant printed version in: Gerson Lange, Frankfurt: Louis Golde, 1909.]
J. West, Generating trees and Catalan and Schröder numbers, Discrete Math.146 (1995) 247–262.
H. S. Wilf, What is an answer?, Amer. Math. Monthly89 (1982) 289–292.
Author information
Authors and Affiliations
Additional information
Supported in part by the NSF.
Rights and permissions
About this article
Cite this article
Zeilberger, D. Enumeration Schemes and, more importantly, their automatic generation. Annals of Combinatorics 2, 185–195 (1998). https://doi.org/10.1007/BF01608488
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF01608488