Inapproximability of Counting Permutation Patterns

Detecting and counting copies of permutation patterns are fundamental algorithmic problems, with applications in the analysis of rankings, nonparametric statistics, and property testing tasks such as independence and quasirandomness testing. From an algorithmic perspective, there is a sharp difference in complexity between detecting and counting the copies of a given length-k pattern in a length-n permutation. The former admits a 2O(k2) · n time algorithm (Guillemot and Marx, 2014) while the latter cannot be solved in time f(k)· no(k/log k) unless the Exponential Time Hypothesis (ETH) fails (Berendsohn, Kozma, and Marx, 2021). In fact already for patterns of length 4, exact counting is unlikely to admit near-linear time algorithms under standard fine-grained complexity assumptions (Dudek and Gawrychowski, 2020). Recently, Ben-Eliezer, Mitrovi'c and Sristava (2026) showed that for patterns of length up to 5, a (1+varepsilon)-approximation of the pattern count can be computed in near-linear time, yielding a separation between exact and approximate counting for small patterns, and conjectured that approximate counting is asymptotically easier than exact counting in general. We strongly refute their conjecture by showing that, under ETH, no algorithm running in time f(k)· no(k/log k) can approximate the number of copies of a length-k pattern within a multiplicative factor n(1/2-varepsilon)k. The lower bound on runtime matches the conditional lower bound for exact pattern counting, and the obtained bound on the multiplicative error factor is essentially tight, as an nk/2-approximation can be computed in 2O(k2)· n time using an algorithm for pattern detection.