Enumeration of Pin-Permutations - Archive ouverte HAL Accéder directement au contenu
Article Dans Une Revue The Electronic Journal of Combinatorics Année : 2011

Enumeration of Pin-Permutations

Résumé

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.
Fichier principal
Vignette du fichier
ejc2010.pdf (450.28 Ko) Télécharger le fichier
Origine : Fichiers éditeurs autorisés sur une archive ouverte
Loading...

Dates et versions

hal-00348664 , version 1 (19-12-2008)
hal-00348664 , version 2 (05-03-2011)

Identifiants

  • HAL Id : hal-00348664 , version 2

Citer

Frédérique Bassino, Mathilde Bouvel, Dominique Rossin. Enumeration of Pin-Permutations. The Electronic Journal of Combinatorics, 2011, 18 (1), pp.P57. ⟨hal-00348664v2⟩
536 Consultations
259 Téléchargements

Partager

Gmail Facebook X LinkedIn More