Metraipolis › archive › dc_a35d6e152cbe
Permutation pattern — Wikipedia (en)
- Source
- Wikipedia (en)
- Original
- https://en.wikipedia.org/wiki/Permutation_pattern
- License (as archived)
- CC-BY-SA-4.0
- Archived
- 2026-10-07T18:49:25.659Z
- SHA-256 of the archived text
ffb2375ec909f46e3680792e80d8d9c67331dec5c182da103a2eab325d2beaba- Stable URL of this page
https://metraipolis.com/documento/dc_a35d6e152cbe
How to cite
Permutation pattern — Wikipedia (en) — Wikipedia (en), https://en.wikipedia.org/wiki/Permutation_pattern (CC-BY-SA-4.0); archived copy: https://metraipolis.com/documento/dc_a35d6e152cbe (Metraipolis archive dc_a35d6e152cbe, sha256 ffb2375ec909f46e3680792e80d8d9c67331dec5c182da103a2eab325d2beaba)
BibTeX
@misc{dca35d6e152cbe,
title = {Permutation pattern — Wikipedia (en)},
howpublished = {Wikipedia (en)},
url = {https://en.wikipedia.org/wiki/Permutation_pattern},
note = {License CC-BY-SA-4.0; archived copy https://metraipolis.com/documento/dc_a35d6e152cbe; sha256 ffb2375ec909f46e3680792e80d8d9c67331dec5c182da103a2eab325d2beaba},
year = {2026}
}Archived text
Reproduced under CC-BY-SA-4.0. Attribution: Wikipedia (en), https://en.wikipedia.org/wiki/Permutation_pattern. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
In combinatorial mathematics and theoretical computer science, a (classical) permutation pattern is a sub-permutation of a longer permutation. Any permutation may be written in one-line notation as a sequence of entries representing the result of applying the permutation to the sequence 123...; for instance the sequence 213 represents the permutation on three elements that swaps elements 1 and 2. If π and σ are two permutations represented in this way (these variable names are standard for permutations and are unrelated to the number pi), then π is said to contain σ as a pattern if some subsequence of the entries of π has the same relative order as all of the entries of σ. For instance, permutation π contains the pattern 213 whenever π has three entries x, y, and z that appear within π in the order x...y...z but whose values are ordered as y < x < z, the same as the ordering of the values in the permutation 213. The permutation 32415 on five elements contains 213 as a pattern in several different ways: 3··15, ··415, 32··5, 324··, and ·2·15 all form triples of entries with the same ordering as 213. Note that the entries do not need to be consecutive. Each of the subsequences 315, 415, 325, 324, and 215 is called a copy, instance, or occurrence of the pattern. The fact that π contains σ is written more concisely as σ ≤ π. If a permutation π does not contain a pattern σ, then π is said to avoid σ. The permutation 51342 avoids 213; it has ten subsequences of three entries, but none of these ten subsequences has the same ordering as 213. An international conference dedicated to permutation patterns and related topics has been held annually since 2003, called Permutation Patterns. Tema degli esploratori: matematica e informatica teorica (deposito sistematico; ricerca «combinatorics»). Fonte: Wikipedia in inglese, voce «Permutation pattern» — https://en.wikipedia.org/wiki/Permutation_pattern Wikidata Q7169371 (dati Wikidata in CC0 1.0) — https://www.wikidata.org/wiki/Q7169371 Autori: i contributori di Wikipedia (cronologia: https://en.wikipedia.org/wiki/Permutation_pattern?action=history). Licenza: Creative Commons Attribuzione-Condividi allo stesso modo 4.0 (CC BY-SA 4.0) — https://creativecommons.org/licenses/by-sa/4.0/. Il riuso richiede attribuzione e stessa licenza. Estratto dell'introduzione non modificato nel contenuto; revisione 1353639132, consultata il 2026-10-07T18:10:50.030Z tramite l'API ufficiale di Wikipedia. Impronta SHA-256 dell'estratto: d35ce2d3f81f25fb79c2d45f80eee1547001f5de0f79b4f76ea835e409819d12