Factoring Pattern-Free Permutations into Separable ones - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Année : 2024

Factoring Pattern-Free Permutations into Separable ones

Résumé

We show that for any permutation π there exists an integer k π such that every permutation avoiding π as a pattern is a product of at most k π separable permutations. In other words, every strict class C of permutations is contained in a bounded power of the class of separable permutations. This factorisation can be computed in linear time, for any fixed π. The central tool for our result is a notion of width of permutations, introduced by Guillemot and Marx [SODA '14] to efficiently detect patterns, and later generalised to graphs and matrices under the name of twin-width. Specifically, our factorisation is inspired by the decomposition used in the recent result that graphs with bounded twin-width are polynomially χ-bounded. As an application, we show that there is a fixed class C of graphs of bounded twin-width such that every class of bounded twin-width is a first-order transduction of C.
Fichier principal
Vignette du fichier
separable-product.pdf (432.8 Ko) Télécharger le fichier
Origine Fichiers produits par l'(les) auteur(s)

Dates et versions

hal-04292977 , version 1 (17-11-2023)

Identifiants

  • HAL Id : hal-04292977 , version 1

Citer

Édouard Bonnet, Romain Bourneuf, Colin Geniet, Stéphan Thomassé. Factoring Pattern-Free Permutations into Separable ones. SODA 2024, Jan 2024, Alexandria, United States. ⟨hal-04292977⟩
14 Consultations
10 Téléchargements

Partager

Gmail Mastodon Facebook X LinkedIn More