 |
|
|
|
| HAL : hal-00348664, version 2 |
| Fiche détaillée |  Récupérer au format |
|
|
| Electronic Journal of Combinatorics 18, 1 (2011) P57 |
|
|
| Versions disponibles : | v1 (20-12-2008) | v2 (05-03-2011) |
|
|
|
|
| Enumeration of Pin-Permutations |
|
|
| Frédérique Bassino 1Mathilde Bouvel 2 |
|
|
| (2011) |
|
|
|
| In this paper, we study the class of pin-permutations, that is to say of permutations having a pin representation. This class has been recently introduced in an article of Brignall, Huczinska and Vatter, where it is used to find properties (algebraicity of the generating function, decidability of membership) of classes of permutations, depending on the simple permutations this class contains. We give a recursive characterization of the substitution decomposition trees of pin-permutations, which allows us to compute the generating function of this class, and consequently to prove, as it is conjectured, the rationality of this generating function. Moreover, we show that the basis of the pin-permutation class is infinite. |
|
|
|
|
|
|
|
|
|
|
|
| 1 : | Laboratoire d'informatique de Paris-nord (LIPN) |
|
|
|
CNRS : UMR7030 – Université Paris XIII - Paris Nord |
|
|
| 2 : | Laboratoire d'informatique Algorithmique : Fondements et Applications (LIAFA) |
|
|
|
CNRS : UMR7089 – Université Paris VII - Paris Diderot |
|
|
| 3 : | Laboratoire d'informatique de l'école polytechnique (LIX) |
|
|
|
CNRS : UMR7161 – Polytechnique - X |
|
|
|
|
|
|
|
|
|
| Algorithmique et Combinatoire |
|
|
|
|
| Domaine | : | Mathématiques/Combinatoire |
|
|
| Permutation – Generating function – Permutation Pattern |
|
|
|
| Liste des fichiers attachés à ce document : | ||||||||||
|
||||||||||
|
|
|
| hal-00348664, version 2 | |
| http://hal.archives-ouvertes.fr/hal-00348664 | |
| oai:hal.archives-ouvertes.fr:hal-00348664 | |
| Contributeur : Dominique Rossin | |
| Soumis le : Samedi 5 Mars 2011, 16:43:36 | |
| Dernière modification le : Lundi 5 Décembre 2011, 11:23:32 | |
