# The Complexity of Pattern Matching for 321-Avoiding and Skew-Merged Permutations

@article{Albert2016TheCO,
title={The Complexity of Pattern Matching for 321-Avoiding and Skew-Merged Permutations},
author={Michael H. Albert and Marie-Louise Lackner and Martin Lackner and Vincent Vatter},
journal={Discret. Math. Theor. Comput. Sci.},
year={2016},
volume={18}
}
• Published 20 October 2015
• Computer Science, Mathematics
• Discret. Math. Theor. Comput. Sci.
The Permutation Pattern Matching problem, asking whether a pattern permutation $\pi$ is contained in a permutation $\tau$, is known to be NP-complete. In this paper we present two polynomial time algorithms for special cases. The first algorithm is applicable if both $\pi$ and $\tau$ are $321$-avoiding; the second is applicable if $\pi$ and $\tau$ are skew-merged. Both algorithms have a runtime of $O(kn)$, where $k$ is the length of $\pi$ and $n$ the length of $\tau$.
18 Citations

## Figures from this paper

Counting 4-Patterns in Permutations Is Equivalent to Counting 4-Cycles in Graphs
• Computer Science
ISAAC
• 2020
By designing two-way reductions that imply that an $O(n^{4/3-\varepsilon})$ time algorithm for counting occurrences would imply an exciting breakthrough for counting (and hence also detecting) 4-cycles, a systematic study of the complexity of counting occurrences for different patterns of fixed small length k is investigated.
Griddings of permutations and hardness of pattern matching
• Mathematics, Computer Science
MFCS
• 2021
A new hardness reduction is presented which allows us to show, in a uniform way, that Av(σ)-PPM is hard for every σ of size at least 6, for everyπ of size 5 except the symmetry class of 41352, as well as forevery σ symmetric to one of the three permutations 4321, 4312 and 4231.
Permutation Pattern Matching for Doubly Partially Ordered Patterns
• Mathematics, Computer Science
CPM
• 2022
The Doubly Partially Ordered Pattern Matching (or DPOP Matching) problem is studied, a natural extension of the Permutation pattern matching problem, and restrictions on several parameters/properties of the input are considered, giving a(n almost) complete landscape for the algorithmic complexity of the problem.
Wilf collapse in permutation classes
• Mathematics
• 2019
For a hereditary permutation class $\mathcal{C}$, we say that two permutations $\pi$ and $\sigma$ of $\mathcal{C}$ are Wilf-equivalent in $\mathcal{C}$, if $\mathcal{C}$ has the same number of
Finding and counting permutations via CSPs
• Computer Science, Mathematics
IPEC
• 2019
Two new algorithms are given for permutation patterns and pattern avoidance, one whose running time is the better of the jats:inline-formula and the other a polynomial-space algorithm.
On permutations avoiding partially ordered patterns defined by bipartite graphs
• Mathematics
• 2022
Partially ordered patterns (POPs) generalize the notion of classical patterns studied in the literature in the context of permutations, words, compositions and partitions. In this paper, we give a
Rationality for subclasses of 321-avoiding permutations
• Computer Science, Mathematics
Eur. J. Comb.
• 2019
C O ] 4 D ec 2 01 7 Rationality For Subclasses of 321-Avoiding Permutations
• M. AlbertVincent Vatter
• Computer Science, Mathematics
• 2018
We prove that every proper subclass of the 321-avoiding permutations that is defined either by only finitely many additional restrictions or is well-quasi-ordered has a rational generating function.
C O ] 1 J an 2 01 9 Rationality For Subclasses of 321-Avoiding Permutations
• M. AlbertVincent Vatter
• Computer Science, Mathematics
• 2019
We prove that every proper subclass of the 321-avoiding permutations that is defined either by only finitely many additional restrictions or is well-quasi-ordered has a rational generating function.
Labelled well-quasi-order for permutation classes
• Mathematics
• 2020
While the theory of labeled well-quasi-order has received significant attention in the graph setting, it has not yet been considered in the context of permutation patterns. We initiate this study

## References

SHOWING 1-10 OF 31 REFERENCES
A Fast Algorithm for Permutation Pattern Matching Based on Alternating Runs
• Computer Science, Mathematics
Algorithmica
• 2015
This paper presents a fixed-parameter algorithm solving the NP-complete Permutation Pattern Matching problem with a worst-case runtime of 1.79, and proves that under standard complexity theoretic assumptions such a Fixedparameter tractability result is not possible for P.
Pattern Matching for 321-Avoiding Permutations
• Mathematics, Computer Science
ISAAC
• 2009
The Permutation Pattern problem is proved to be solvable in O(k 2 n 6) time, and W[1]-hardness of a 2-colored version of this latter problem is shown.
On Complexity of the Subpattern Problem
• Computer Science, Mathematics
SIAM J. Discret. Math.
• 2008
It turns out that for most permutations $C^{\bf T}(\pi) = \Omega(k)$, and thus, in general, the upper bound on the running time cannot be significantly improved using this approach.
Pattern Matching for Separable Permutations
• Mathematics, Computer Science
SPIRE
• 2016
This paper focuses on separable permutations (those permutations that avoid both 2413 and 3142, or, equivalently, that admit a separating tree).
Finding Pattern Matchings for Permutations
Finding small patterns in permutations in linear time
• Mathematics, Computer Science
SODA
• 2014
A novel type of decompositions for permutations and a corresponding width measure is introduced and shown how to solve the Permutation Pattern problem in linear time if a bounded-width decomposition is given in the input.
Algorithms for Pattern Involvement in Permutations
• Computer Science
ISAAC
• 2001
By using carefully chosen data structures to fine tune the methods, it is established that any pattern of length 4 can be detected in O(n log n) time.
Forbidden subsequences
Parallel algorithms for separable permutations
• Computer Science, Mathematics
Discret. Appl. Math.
• 2005