Generalized permutation patterns - a short survey

Research output: Contribution to journalArticle

35 Downloads (Pure)

Abstract

An occurrence of a classical pattern p in a permutation π is a
subsequence of π whose letters are in the same relative order (of size) as those
in p. In an occurrence of a generalized pattern, some letters of that subsequence
may be required to be adjacent in the permutation. Subsets of permutations
characterized by the avoidance—or the prescribed number of occurrences—
of generalized patterns exhibit connections to an enormous variety of other
combinatorial structures, some of them apparently deep. We give a short
overview of the state of the art for generalized patterns.
Original languageEnglish
Pages (from-to)137–152
Number of pages16
JournalLondon Mathematical Society Lecture Note Series
Publication statusPublished - 2010

    Fingerprint

Keywords

  • permutation
  • pat- tern avoidance
  • Generalized permutation patterns
  • pattern

Cite this