Sorting and preimages of pattern classes

Anders Claesson, Henning Úlfarsson

Research output: Chapter in Book/Report/Conference proceedingChapter

2 Citations (Scopus)

Abstract

We introduce an algorithm to determine when a sorting operation, such as stack-sort or bubble-sort, outputs a given pattern. The algorithm provides a new proof of the description of West-2-stack-sortable permutations, that is permutations that are completely sorted when passed twice through a stack, in terms of patterns. We also solve the long-standing problem of describing West-3-stack-sortable permutations. This requires a new type of generalized permutation pattern we call a decorated pattern.
Original languageEnglish
Title of host publication24th International Conference on Formal Power Series and Algebraic Combinatorics (FPSAC 2012)
Place of PublicationNancy, France
Pages595-606
Number of pages12
Publication statusPublished - 2012

Keywords

  • sorting operations
  • stack-sort
  • bubble-sort
  • sorting algorithm
  • pattern classes

Fingerprint Dive into the research topics of 'Sorting and preimages of pattern classes'. Together they form a unique fingerprint.

  • Cite this

    Claesson, A., & Úlfarsson, H. (2012). Sorting and preimages of pattern classes. In 24th International Conference on Formal Power Series and Algebraic Combinatorics (FPSAC 2012) (pp. 595-606). Nancy, France.