Approximate counting of permutation patterns

Omri Ben-Eliezer, Slobodan Mitrović, Pranjal Srivastava

We consider the problem of counting the copies of a length-$k$ pattern $\sigma$ in a sequence $f:[n]\to \mathbb{R}$, where a copy is a subset of indices $i_1 < \ldots < i_k \in…