Restricted compositions and permutations: from old to new Gray codes

DOI10.1016/j.ipl.2011.03.022zbMath1260.94083OpenAlexW2080667615MaRDI QIDQ1944104

Vicentiu Vajnovszki, Rémi Vernay

Publication date: 4 April 2013

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ipl.2011.03.022

zbMATH Keywords

permutationscombinatorial problemsGray codesinversion tablebounded compositions of an integer

Mathematics Subject Classification ID

Combinatorial aspects of partitions of integers (05A17) Permutations, words, matrices (05A05) Combinatorial codes (94B25)

Related Items (5)

Generalized algorithm for restricted weak composition generation ⋮ Flip-swap languages in binary reflected Gray code order ⋮ An efficient Gray code algorithm for generating all permutations with a given major index ⋮ Gray code orders for \(q\)-ary words avoiding a given factor ⋮ Combinatorial generation via permutation languages. I. Fundamentals

Cites Work

• A loop-free two-close Gray-code algorithm for listing \(k\)-ary Dyck words
• A CAT algorithm for generating permutations with a fixed number of inversions
• On Generating the N-ary Reflected Gray Codes
• Combinatorial Gray Codes
• A Gray code for compositions
• Generation of Permutations by Adjacent Transposition
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Restricted compositions and permutations: from old to new Gray codes