Preface

The Eulerian numbers on restricted centrosymmetric permutations pp. 99-118

M. Barnabei, F. Bonetti, and M. Silimbani

Deciding the finiteness of the number of simple permutations contained in a wreath-closed class is polynomial pp. 119-135

F. Bassino, M. Bouvel, A. Pierrot, and D. Rossin

Refining enumeration schemes to count according to the inversion number pp. 137-160

A. M. Baxter

Medians of an odd number of permutations pp. 161-175

G. Blin, M. Crochemore, S. Hamel, and S. Vialette

New Dumont permutations pp. 177-206

A. Burstein, M. Josuat-Verges, and W. Stromquist

Centrosymmetric permutations and involutions avoiding 1243 and 2143 pp. 207-232

M. Flanagan and M. Silimbani

Permutation q-enumeration with the Schur row adder pp. 233-248

A. M. Garsia

Some properties of non minimal permutations pp. 249-264

E. Grazzini and E. Pergola

Dyck paths, standard Young tableaux, and pattern avoiding permutations pp. 265-284

H. H. Gudmundsson

q-analogues of the number of permutations with k-excedances pp. 285-320

J. Liese and J. Remmel

Enumeration of Wilf classes in Sn ∫ Cr for two patterns of length 3 pp. 321-338

M. Phillipson, M. Riehl, and T. Williams