Annals of Combinatorics 2 (1998) 185-195


Enumeration Schemes and, More Importantly, Their Automatic Generation

Doron Zeilberger

Department of Mathematics, Temple University, Philadelphia, PA 19122, USA
zeilberg@math.temple.edu, http://www.math.temple.edu/~zeilberg

Received May 27, 1998

AMS Subject Classification: 05A15

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.

Keywords: Permutation with restricted positions, Automated proofs in combinatorics, Wilf classes


References

1.  D.E. Knuth, The Art of Computer Programming, Vol.3, Addison-Wesley, Reading, MA, 1973; 2nd Ed., 1997.

2.  L.B. Gerson, Sefer Maàsei Khosev, 1321, Orange, France. [Extant printed version in: Gerson Lange, Frankfurt: Louis Golde, 1909.]

3.  J. West, Generating trees and Catalan and Schrüder numbers, Discrete Math. 146 (1995) 247–262.

4.  H.S. Wilf, What is an answer?, Amer. Math. Monthly 89 (1982) 289–292.


Get the LaTex | DVI | PS file of this abstract.

back