A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf
.
Generating restricted classes of involutions, Bell and Stirling permutations
2010
European journal of combinatorics (Print)
We present a recursive generating algorithm for unrestricted permutations which is based on both the decomposition of a permutation as a product of transpositions and that as a union of disjoint cycles. It generates permutations at each recursive step and slight modifications of it produce generating algorithms for Bell permutations and involutions. Further refinements yield algorithms for these classes of permutations subject to additional restrictions: a given number of cycles or/and fixed
doi:10.1016/j.ejc.2009.03.028
fatcat:tyh5ovhcaja7lgnov2ryl2tsri