Preface

The enumeration of permutations avoiding 2143 and 4231 pp. 87-98

M. H. Albert, M. D. Atkinson, and R. Brignall

Non-overlapping permutation patterns pp. 99-105

M. Bóna 

Avoiding colored partitions of lengths two and three pp. 107-128

A. M. Goyt and L. K. Pudwell

Almost avoiding pairs of permutations pp. 129-139

W. Griffiths, R. Smith, and D. Warren

Patterns in column strict fillings of rectangular arrays pp. 141-171

J. Harmse and J. Remmel

Pattern matching in the cycle structures of permutations pp. 173-208

M. E. Jones and J. Remmel

Smooth compositions and smooth words pp. 209-226

A. Knopfmacher, T. Mansour, and A. Munagi

The fine structure of 4321 avoiding involutions and 321 avoiding involutions pp. 227-238

P. Manara and C. Perelli Cippo

Restricted partitions and generalized Catalan numbers pp. 239-251

T. Mansour and M. Shattuck

Computational approaches to consecutive pattern avoidance in permutations pp. 253-268

B. Nakamura 

231-avoiding permutations and the Schensted correspondence pp. 269-272

M. Tiefenbruck

A unification of permutation patterns related to Schubert varieties pp. 273-296

H. Úlfarsson

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)!)  pp. 297-298

D. Zeilberger