An algorithm computing combinatorial specifications of permutation classes

Abstract : 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.
Type de document :
Article dans une revue
Discrete Applied Mathematics, Elsevier, 2017, 224, pp.16-44. 〈10.1016/j.dam.2017.02.013〉
Liste complète des métadonnées

https://hal-upec-upem.archives-ouvertes.fr/hal-01175234
Contributeur : Carine Pivoteau <>
Soumis le : vendredi 10 juillet 2015 - 13:45:46
Dernière modification le : jeudi 7 février 2019 - 14:52:38

Lien texte intégral

Identifiants

Citation

Frédérique Bassino, Mathilde Bouvel, Adeline Pierrot, Carine Pivoteau, Dominique Rossin. An algorithm computing combinatorial specifications of permutation classes. Discrete Applied Mathematics, Elsevier, 2017, 224, pp.16-44. 〈10.1016/j.dam.2017.02.013〉. 〈hal-01175234〉

Partager

Métriques

Consultations de la notice

586