<%@ Page Language="C#" MasterPageFile="~/Main.master" AutoEventWireup="true" Title="Volume7 Issue1" %>
Words Restricted by 3-Letter Generalized Multipermutation Patterns
Alexander Burstein1 and Toufik Mansour2
1Department of Mathematics, Iowa State University, Ames, IA 50011-2064, USA
burstein@math.iastate.edu
2Department of Mathematics, Chalmers Univeristy of Technology, 412 96 Göteborg, Sweden
toufik@math.chalmers.se
Annals of Combinatorics 7 (1) p.1-14 March, 2003
AMS Subject Classification: 05A05, 05A15
Abstract:
We find exact formulas and/or generating functions for the number of words avoiding 3-letter generalized multipermutation patterns and find which of them are equally avoided.
Keywords: k-ary words, generalized patterns, generating functions

References:

1. E. Babson and E. Steingr®™msson, Generalized permutation patterns and a classification of the Mahonian statistics, S®¶m. Lothar. Combin. B44b (2000) 18 pp.

2. A. Burstein, Enumeration of words with forbidden patterns, Ph.D. Thesis, University of Pennsylvania, 1998.

3. A. Burstein and T.Mansour, Words restricted by patterns with at most 2 distinct letters, Elect. J. Combin. 9 (2) (2002) #R3.

4. A. Claesson, Generalized pattern avoidance, Europ. J. Combin. 22 (2001) 961®C971.

5. A. Claesson and T. Mansour, Enumerating permutations avoiding a pair of Babson- Steingr®™msson patterns, preprint, math.CO/0107044.

6. D.E. Knuth, The Art of Computer Programming, Vols. 1 and 3, Addison-Wesley, NY, 1968, 1973.

7. A.M. Odlyzko, Asymptotic enumeration methods, In: Handbook of Combinatorics, Vol. 2, R.L. Graham, M. Grötchel and L. Lov®Ęsz, Eds., MIT Press, 1995, pp. 1063®C1230.

8. R. Simion and F.W. Schmidt, Restricted permutations, Europ. J. of Combin. 6 (1985) 383®C 406.

9. D. Zeilberger, Enumeration schemes, and more importantly, their automatic generation, Ann. Combin. 2 (1998) 185®C195.