Pure Mathematics and Applications
ALGEBRA AND THEORETICAL COMPUTER SCIENCE

Home

Editorial Board

Submissions

Contents

Subscription

Volume 21 (2010), Issue No. 2

Preface

M. Barnabei, F. Bonetti, M. Silimbani: The Eulerian numbers on restricted centrosymmetric permutations (99 -- 118)

F. Bassino, M. Bouvel, A. Pierrot, D. Rossin: Deciding the finiteness of the number of simple permutations contained in a wreath-closed class is polynomial (119 -- 135)

A.M. Baxter: Refining enumeration schemes to count according to the inversion number (137 -- 160)

G. Blin, M. Crochemore, S. Hamel, S. Vialette: Medians of an odd number of permutations (161 -- 175)

A. Burstein, M. Josuat-Verges, W. Stromquist: New Dumont permutations (177 -- 206)

M. Flanagan, M. Silimbani: Centrosymmetric permutations and involutions avoiding 1243 and 2143 (207 -- 232)

A.M. Garsia: Permutation q-enumeration with the Schur row adder (233 -- 248)

E. Grazzini, E. Pergola: Some properties of non minimal permutations (249 -- 264)

H.H. Gudmundsson: Dyck paths, standard Young tableaux, and pattern avoiding permutations (265 -- 284)

J. Liese, J. Remmel: Q-analogues of the number of permutations with k-excedances (285 -- 320)

M. Phillipson, M. Riehl, T. Williams: Enumeration of Wilf classes in Sn ∫ Cr for two patterns of length 3 (321 -- 338)