Gray code for permutations with a fixed number of left-to-right minima.

MaRDI QIDQ2931482zbMATH OpenFDO

Authors Jean-Luc Baril

Publication date 25 November 2014

zbMATH Keywords

generating algorithmGray codeleft-to-right minimumpermutationStirling number

Mathematics Subject Classification ID

Permutations, words, matrices (05A05) Combinatorial codes (94B25)

Recommendations

• Gray code for permutations with a fixed number of cycles
• A Gray code for permutations of size 2d with d descents
• Gray code for derangements
• More restrictive Gray codes for some classes of pattern avoiding permutations
• Gray code for Cayley permutations

Cited in

(12)

• Gray code for derangements
• Gray code for Cayley permutations
• A Gray code for the shelling types of the boundary of a hypercube
• Restricted compositions and permutations: from old to new Gray codes
• The pure descent statistic on permutations
• Optimal Gray code for involutions
• An efficient Gray code algorithm for generating all permutations with a given major index
• Gray codes for involutions
• A Gray code for permutations of size 2d with d descents
• scientific article; zbMATH DE number 5761830 (Why is no real title available?)
• Note on Gray codes for permutation lists
• Gray code for permutations with a fixed number of cycles

This page was built for publication: Gray code for permutations with a fixed number of left-to-right minima.

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2931482)