Pacific Workshop on Pattern Avoiding Permutations

March 31 - April 1, 2011

Department of Mathematics Simon Fraser University

10940 IRMACS Center

Burnaby, BC

What is it?

In this informal event, we will consider some recent progress on and applications of pattern avoiding permutations. In particular, problems of enumeration; characterization; applications and random generation

Participants will give a short talk, and then we will break off into working groups.

We are grateful for sponsorship funds from the Pacific Institute of Mathematical Sciences (PIMS) and for research space in IRMACS

Tentative Schedule (Each day)

  • 9 - 12 Short presentations by participants
  • 12 - 1 Lunch
  • 1 - 5 Working groups
  • 3:30 - 4 Coffee Break
  • Thursday Speakers

  • Lara Pudwell (Valparaiso University), Algorithmic enumeration
  • Sergi Elizalde (Dartmouth), Pattern avoidance in dynamical systems
  • Marni Mishna (SFU), Common Interval Trees
  • Andrew Rechnitzer (UBC), Two-stack sortable permutations

    Friday Speakers

  • Andrew Crites (Washington), Pattern avoidance in affine permutations
  • Cedric Chauve (SFU) Intriguing families of interval in permutations that appear when one tries to generate all common intervals
  • Tom Boothby (SFU), Cyclic pattern avoidance
  • Sophie Burrill (SFU) Crossings and nestings in permutations
    For more information, please email Marni Mishna or Tom Boothby. (mmishna | tboothby) - at -