Volume 22 (2011), Issue No. 2
Preface
M. H. Albert, M. D. Atkinson, R. Brignall: The enumeration of permutations avoiding 2143 and 4231 (87 -- 98)
M. Bóna: Non-overlapping permutation patterns (99 -- 105)
A. M. Goyt, L. K. Pudwell: Avoiding colored partitions of lengths two and three (107 -- 128)
W. Griffiths, R. Smith, D. Warren: Almost avoiding pairs of permutations (129 -- 139)
J. Harmse, J. Remmel: Patterns in column strict fillings of rectangular arrays (141 -- 171)
M. E. Jones, J. Remmel: Pattern matching in the cycle structures of permutations (173 -- 208)
A. Knopfmacher, T. Mansour, A. Munagi: Smooth compositions and smooth words (209 -- 226)
P. Manara, C. Perelli Cippo: The fine structure of 4321 avoiding involutions and 321 avoiding involutions (227 -- 238)
T. Mansour, M. Shattuck: Restricted partitions and generalized Catalan numbers (239 -- 251)
B. Nakamura: Computational approaches to consecutive pattern avoidance
in permutations (253 -- 268)
M. Tiefenbruck: 231-avoiding permutations and the Schensted correspondence (269 -- 272)
H. Úlfarsson: A unification of permutation patterns related to Schubert varieties (273 -- 296)
D. Zeilberger: Alexander Burstein's lovely combinatorial proof of John Noonan's
beautiful theorem that the number of n-permutations that contain the pattern 321 exactly once equals (3/n)(2n)!/((n - 3)!(n + 3)!) (297 -- 298)
