Enumeration of Pin-Permutations

Frédérique Bassino, Mathilde Bouvel, Dominique Rossin

Abstract


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 by Brignall, Huczynska and Vatter who used it 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 by Brignall, Ruškuc and Vatter, the rationality of this generating function. Moreover, we show that the basis of the pin-permutation class is infinite.


Full Text: PDF