Generating restricted classes of involutions, Bell and Stirling permutations

DOI10.1016/j.ejc.2009.03.028zbMath1227.05024OpenAlexW2078236616WikidataQ60692168 ScholiaQ60692168MaRDI QIDQ966165

Maddalena Poneti, Vicentiu Vajnovszki

Publication date: 27 April 2010

Published in: European Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejc.2009.03.028

zbMATH Keywords

fixed pointscyclesStirling permutationsBell permutationsrecursive generating algorithm for permutations

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15) Permutations, words, matrices (05A05)

Related Items (3)

Unnamed Item ⋮ Gray codes and lexicographical combinatorial generation for nonnesting and sparse nonnesting set partitions ⋮ Gray codes for signed involutions

Uses Software

• OEIS

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Gray code for permutations with a fixed number of cycles
• Combinatorial Gray codes for classes of pattern avoiding permutations
• A CAT algorithm for generating permutations with a fixed number of inversions
• Stirling numbers interpolation using permutations with forbidden subsequences
• Gray code for derangements
• Exhaustive generation of combinatorial objects by ECO
• Théorie géométrique des polynômes eulériens
• Generation of Permutations by Adjacent Transposition
• Permutation by Adjacent Interchanges
• A survey: Hamiltonian cycles in Cayley graphs

This page was built for publication: Generating restricted classes of involutions, Bell and Stirling permutations