An algorithm computing combinatorial specifications of permutation classes - Archive ouverte HAL Accéder directement au contenu
Article Dans Une Revue Discrete Applied Mathematics Année : 2017

An algorithm computing combinatorial specifications of permutation classes

Résumé

This article presents a methodology that automatically derives a combinatorial specification for a permutation class C, given its basis B of excluded patterns and the set of simple permutations in C, when these sets are both finite. This is achieved considering both pattern avoidance and pattern containment constraints in permutations. The obtained specification yields a system of equations satisfied by the generating function of C, this system being always positive and algebraic. It also yields a uniform random sampler of permutations in C. The method presented is fully algorithmic.
Fichier principal
Vignette du fichier
1506.00868.pdf (999.69 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)

Dates et versions

hal-01175234 , version 1 (05-03-2024)

Identifiants

Citer

Frédérique Bassino, Mathilde Bouvel, Adeline Pierrot, Carine Pivoteau, Dominique Rossin. An algorithm computing combinatorial specifications of permutation classes. Discrete Applied Mathematics, 2017, 224, pp.16-44. ⟨10.1016/j.dam.2017.02.013⟩. ⟨hal-01175234⟩
409 Consultations
4 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More