Enumeration of pin-permutations
type: Item
instance of: scholarly article
title: Enumeration of pin-permutations
zbMATH Open document ID: 1217.05021
author: Frédérique Bassino
author: Mathilde Bouvel
author: Dominique Rossin
published in: The Electronic Journal of Combinatorics
publication date: 2011-06-01T00:00:00Z
full work available at URL: https://eudml.org/doc/226310
full work available at URL: v18i1p57.html
review text: Summary: 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 [16], 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 in [18], the rationality of this generating function. Moreover, we show that the basis of the pin-permutation class is infinite.
Mathematics Subject Classification ID: 05A15
Mathematics Subject Classification ID: 05A05
zbMATH DE Number: 5902987
MaRDI profile type: Publication
description: scientific article; zbMATH DE number 5902987