Omri Ben‐Eliezer

Approximate counting of permutation patterns

2024 · arXiv (Cornell University)

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