A Gray code for permutations of size 2d with d descents

MaRDI QIDQ2915596zbMATH OpenFDO

Authors Elisabetta Grazzini, E. Pergola

Publication date 18 September 2012

Published in PU.M.A. Pure Mathematics and Applications (Search for Journal in Brave)

zbMATH Keywords

permutationscombinatorial problemsexhaustive generationGray codesreflect able languagestandem duplication -- random loss model

Mathematics Subject Classification ID

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

Recommendations

• Note on Gray codes for permutation lists
• Gray code for permutations with a fixed number of cycles
• Gray code for Cayley permutations
• Combinatorial Gray codes for classes of pattern avoiding permutations
• Gray code for permutations with a fixed number of left-to-right minima.
• More restrictive Gray codes for some classes of pattern avoiding permutations
• An efficient Gray code algorithm for generating all permutations with a given major index
• Permutational labelling of constant weight Gray codes
• Some remarks on the combinatories of Gray codes
• A note on iterating an \(\alpha\)-ary Gray code

Cited in

(10)

• Some properties of non minimal permutations
• Ordering of nested square roots of 2 according to the Gray code
• More restrictive Gray codes for some classes of pattern avoiding permutations
• Gray code for permutations with a fixed number of cycles
• Gray code for permutations with a fixed number of left-to-right minima.
• Gray code for Cayley permutations
• An efficient Gray code algorithm for generating all permutations with a given major index
• Gray codes for signed involutions
• Combinatorial Gray codes for classes of pattern avoiding permutations
• Gray code for derangements

This page was built for publication: A Gray code for permutations of size \(2d\) with \(d\) descents

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