Math 2.0

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

  1. Web https://en.wikipedia.org/wiki/Permutation_pattern
About this page
Tag1H8Z1WMG23
URIm2://1H8Z1WMG23
Kindconcept
WritingW0 stub
MSC05A05, 05A15
Same as
Changed2 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.

What links here

Definitions

Results about this

Used by