A survey of consecutive patterns in permutations

Sergi Elizalde

Published 2015-04-27Version 1

A consecutive pattern in a permutation $\pi$ is another permutation $\sigma$ determined by the relative order of a subsequence of contiguous entries of $\pi$. Traditional notions such as descents, runs and peaks can be viewed as particular examples of consecutive patterns in permutations, but the systematic study of these patterns has flourished in the last 15 years, during which a variety of different techniques have been used. We survey some interesting developments in the subject, focusing on exact and asymptotic enumeration results, the classification of consecutive patterns into equivalence classes, and their applications to the study of one-dimensional dynamical systems.