Finding small patterns in permutations in linear time

TL;DR

This paper presents a fixed-parameter tractable algorithm for the permutation pattern problem, utilizing novel permutation decompositions and a width measure to achieve linear time solutions.

Contribution

It introduces a new decomposition technique and width measure for permutations, enabling linear-time algorithms for pattern detection when a bounded-width decomposition is provided.

Findings

The permutation pattern problem is fixed-parameter tractable with respect to pattern size.

A linear-time algorithm either finds the pattern or provides a bounded-width decomposition.

The approach achieves linear time complexity for pattern detection given a suitable decomposition.

Abstract

Given two permutations $\sigma$ and $\pi$, the \textsc{Permutation Pattern} problem asks if $\sigma$ is a subpattern of $\pi$. We show that the problem can be solved in time $2^{O(\ell^2\log \ell)}\cdot n$, where $\ell=|\sigma|$ and $n=|\pi|$. In other words, the problem is fixed-parameter tractable parameterized by the size of the subpattern to be found. We introduce a novel type of decompositions for permutations and a corresponding width measure. We present a linear-time algorithm that either finds $\sigma$ as a subpattern of $\pi$, or finds a decomposition of $\pi$ whose width is bounded by a function of $|\sigma|$. Then we show how to solve the \textsc{Permutation Pattern} problem in linear time if a bounded-width decomposition is given in the input.