ISSN:
0219-3094
Keywords:
05A15
;
Permutation with restricted positions
;
Automated proofs in combinatorics
;
Wilf classes
Source:
Springer Online Journal Archives 1860-2000
Topics:
Mathematics
Notes:
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.
Type of Medium:
Electronic Resource
URL:
http://dx.doi.org/10.1007/BF01608488
Permalink