Enumeration of pin-permutations
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.
- Scaling limits of permutation classes with a finite specification: a dichotomy
- Universal limits of substitution-closed permutation classes
- An algorithm for deciding the finiteness of the number of simple permutations in permutation classes
- A canonical tree decomposition for chirotopes
- A canonical tree decomposition for order types, and some applications
- Pin classes. II: Small pin classes
This page was built for publication: Enumeration of pin-permutations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q540037)