1. Preface

   • Mike Atkinson
   • Michael Albert

   EditorialNotes 23 February 2010 Pages: 1 - 1

2. Permutations Generated by Stacks and Deques

   • Michael Albert
   • Mike Atkinson
   • Steve Linton

   OriginalPaper 16 February 2010 Pages: 3 - 16

3. Separable d-Permutations and Guillotine Partitions

   • Andrei Asinowski
   • Toufik Mansour

   OriginalPaper 16 February 2010 Pages: 17 - 43

4. Permutations Sortable by n – 4 Passes Through a Stack

   • Anders Claesson
   • Mark Dukes
   • Einar Steingrímsson

   OriginalPaper 16 February 2010 Pages: 45 - 51

5. Fibonacci Numbers, Reduced Decompositions, and 321/3412 Pattern Classes

   • Daniel Daly

   OriginalPaper 23 February 2010 Pages: 53 - 64

6. The Enumeration of Maximally Clustered Permutations

   • Hugh Denoncourt
   • Brant C. Jones

   OriginalPaper 23 February 2010 Pages: 65 - 84

7. Enumerating rc-Invariant Permutations with No Long Decreasing Subsequences

   • Eric S. Egge

   OriginalPaper 23 February 2010 Pages: 85 - 101

8. Symmetric Functions and Generating Functions for Descents and Major Indices in Compositions

   • Evan Fuller
   • Jeffrey Remmel

   OriginalPaper Open access 04 March 2010 Pages: 103 - 121

9. Generating Functions for Permutations Avoiding a Consecutive Pattern

   • Jeffrey Liese
   • Jeffrey Remmel

   OriginalPaper 16 February 2010 Pages: 123 - 141

10. Symmetric Permutations Avoiding Two Patterns

    • David Lonoff
    • Jonah Ostroff

    OriginalPaper 16 February 2010 Pages: 143 - 158