Strathprints logo
Strathprints Home | Open Access | Browse | Search | User area | Copyright | Help | Library Home | SUPrimo

Generalized permutation patterns - a short survey

Steingrimsson, Einar (2010) Generalized permutation patterns - a short survey. London Mathematical Society Lecture Note Series. 137–152.

[img]
Preview
PDF
St08_Generalized_permutation.pdf - Draft Version

Download (156kB) | Preview

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.

Item type: Article
ID code: 33799
Keywords: permutation, pat- tern avoidance, Generalized permutation patterns, pattern, Electronic computers. Computer science
Subjects: Science > Mathematics > Electronic computers. Computer science
Department: Faculty of Science > Computer and Information Sciences
Depositing user: Pure Administrator
Date Deposited: 18 Nov 2011 16:41
Last modified: 26 Mar 2015 16:26
URI: http://strathprints.strath.ac.uk/id/eprint/33799

Actions (login required)

View Item View Item