Parity Permutation Pattern Matching - Archive ouverte HAL Access content directly
Conference Papers Year :

Parity Permutation Pattern Matching


Given two permutations, a pattern σ and a text π, Parity Permutation Pattern Matching asks whether there exists a parity and order preserving embedding of σ into π. While it is known that Permutation Pattern Matching is in FPT, we show that adding the parity constraint to the problem makes it W[1]-hard, even for alternating permutations or for 4321-avoiding patterns. However, it remains in FPT if the text avoids a fixed permutation, thanks to a recent meta-theorem on twin-width. On the other hand, as for the classical version, Parity Permutation Pattern Matching remains polynomial-time solvable when both permutations are separable, or if both are 321-avoiding, but NP-hard if the pattern is 321-avoiding and the text is 4321-avoiding.
Fichier principal
Vignette du fichier
Parity_Permutation_Pattern_Matching__cameraready.pdf (377.39 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-03922884 , version 1 (04-01-2023)


  • HAL Id : hal-03922884 , version 1


Virginia Ardévol Martínez, Florian Sikora, Stéphane Vialette. Parity Permutation Pattern Matching. WALCOM, Mar 2023, Hsinchu, Taiwan. ⟨hal-03922884⟩
48 View
33 Download


Gmail Facebook Twitter LinkedIn More