Paperlane

no. 12 · Tuesday 10 November 2026

Emerging consecutive pattern avoidance

Nathanaël Hassler and Sergey Kirgizov

math.CO · v3 · 12 pp

Abstract

In this note we study the asymptotic popularity, that is, the limit probability to find a given consecutive pattern at a random position in a random permutation in the eighteen classes of permutations avoiding at least two length 3 consecutive patterns. We show that for ten classes, this popularity can be readily deduced from the structure of the permutations. By combining analytical and bijective approaches, we study in detail two more involved cases. The problem remains open for five classes.

comments
12 pages, 2 figures, 2 tables
fields
Combinatorics
pdf ↗ page arXiv:2511.02442 ↗