Combinatorics Permutations, partitions, words Concept
Permutation pattern
Summary
A permutation pattern is a short permutation that may occur inside a longer one, see the definition. A permutation contains a pattern if some of its entries appear in the same relative order as the pattern, and avoids it otherwise. The study of pattern avoidance counts the permutations that avoid given patterns. Its central result is the Stanley–Wilf conjecture, now a theorem, which bounds these counts by an exponential.
Where this leads
1 page builds on this one.
Further reading
About this page
| Tag | 1H8Z1WMG23 |
|---|---|
| URI | m2://1H8Z1WMG23 |
| Kind | concept |
| Writing | W0 stub |
| MSC | 05A05, 05A15 |
| Same as | |
| Changed | 2 November 2026 |
Markdown · JSON · Edit on GitHub
What this page needs for W1
- an inventory row: the row of the inventory that the node accounts for (0 of 1)
- a source with a locator (0 of 1)
The writing levels say how complete the text of a page is. They do not measure its truth.