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

Fingerprint

Sorting

Keywords

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

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.
Claesson, Anders ; Úlfarsson, Henning. / Sorting and preimages of pattern classes. 24th International Conference on Formal Power Series and Algebraic Combinatorics (FPSAC 2012) . Nancy, France, 2012. pp. 595-606
@inbook{c401275564cb45eabfd950e0f0a2fc37,
title = "Sorting and preimages of pattern classes",
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.",
keywords = "sorting operations, stack-sort, bubble-sort, sorting algorithm, pattern classes",
author = "Anders Claesson and Henning {\'U}lfarsson",
year = "2012",
language = "English",
pages = "595--606",
booktitle = "24th International Conference on Formal Power Series and Algebraic Combinatorics (FPSAC 2012)",

}

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

Sorting and preimages of pattern classes. / Claesson, Anders; Úlfarsson, Henning.

24th International Conference on Formal Power Series and Algebraic Combinatorics (FPSAC 2012) . Nancy, France, 2012. p. 595-606.

Research output: Chapter in Book/Report/Conference proceedingChapter

TY - CHAP

T1 - Sorting and preimages of pattern classes

AU - Claesson, Anders

AU - Úlfarsson, Henning

PY - 2012

Y1 - 2012

N2 - 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.

AB - 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.

KW - sorting operations

KW - stack-sort

KW - bubble-sort

KW - sorting algorithm

KW - pattern classes

UR - http://www.dmtcs.org/dmtcs-ojs/index.php/proceedings/article/view/dmAR0153

UR - http://www.dmtcs.org/dmtcs-ojs/index.php/proceedings/issue/view/126

M3 - Chapter

SP - 595

EP - 606

BT - 24th International Conference on Formal Power Series and Algebraic Combinatorics (FPSAC 2012)

CY - Nancy, France

ER -

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