Generalized permutation patterns -- a short survey
| dc.creator | Steingrimsson, Einar | |
| dc.date | 2008-01-16 | |
| dc.date | 2008-05-31 | |
| dc.date.accessioned | 2026-07-07T09:41:40Z | |
| dc.date.available | 2026-07-07T09:41:40Z | |
| dc.description | 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. | |
| dc.description | 11 pages. Added a section on asymptotics (Section 8), added more examples of barred patterns equal to generalized patterns (Section 7) and made a few other minor additions. To appear in ``Permutation Patterns, St Andrews 2007'', S.A. Linton, N. Ruskuc, V. Vatter (eds.), LMS Lecture Note Series, Cambridge University Press | |
| dc.identifier | https://arxiv.org/abs/0801.2412 | |
| dc.identifier | http://arxiv.org/abs/0801.2412 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/161907 | |
| dc.subject | Combinatorics | |
| dc.subject | 05A15; 05E15 | |
| dc.title | Generalized permutation patterns -- a short survey | |
| dc.type | text |