More restrictive Gray codes for some classes of pattern avoiding permutations

DOI10.1016/J.IPL.2009.03.025MaRDI QIDQ989488zbMATH OpenOpenAlexFDO

Authors Jean-Luc Baril

Publication date 20 August 2010

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

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

zbMATH Keywords

algorithmsGray codeCatalan numberscentral binomial coefficientspattern avoiding permutationgenerating algorithmSchröder numbers

Mathematics Subject Classification ID

Permutations, words, matrices (05A05) Combinatorics in computer science (68R05) Nonnumerical algorithms (68W05)

Recommendations

• Combinatorial Gray codes for classes of pattern avoiding permutations
• A Gray code for permutations of size \(2d\) with \(d\) descents
• Gray code for permutations with a fixed number of cycles
• Restricted compositions and permutations: from old to new Gray codes
• scientific article; zbMATH DE number 5975298

Cites work

• scientific article; zbMATH DE number 2107707 (Why is no real title available?)
• A CAT algorithm for generating permutations with a fixed number of inversions
• A general exhaustive generation algorithm for Gray structures
• A loopless algorithm for generating the permutations of a multiset
• A new algorithm for generating derangements
• Combinatorial Gray codes for classes of pattern avoiding permutations
• Constant time generation of derangements
• ECO:a methodology for the enumeration of combinatorial objects
• Forbidden subsequences and Chebyshev polynomials
• From Fibonacci to Catalan permutations
• From Motzkin to Catalan permutations
• Generating alternating permutations lexicographically
• Generating permutations with given ups and downs
• Generating trees and the Catalan and Schröder numbers
• Generation of Permutations by Adjacent Transposition
• Gray code for derangements
• Gray code for permutations with a fixed number of cycles
• Gray codes for involutions
• Gray visiting Motzkins
• Loopless generation of up-down permutations
• Permutations with forbidden subsequences and a generalized Schröder number
• Restricted permutations

Cited in

(15)

• A Gray code for permutations of size \(2d\) with \(d\) descents
• An efficient Gray code algorithm for generating all permutations with a given major index
• A Survey of Combinatorial Gray Codes
• On the hardness of Gray code problems for combinatorial objects
• Gray code for permutations with a fixed number of left-to-right minima.
• Combinatorial generation via permutation languages. I: Fundamentals
• scientific article; zbMATH DE number 5975298 (Why is no real title available?)
• Gray codes and lexicographical combinatorial generation for nonnesting and sparse nonnesting set partitions
• Gray code for permutations with a fixed number of cycles
• Combinatorial Gray codes for classes of pattern avoiding permutations
• Strings from linear recurrences and permutations: a gray code
• Optimal Gray code for involutions
• scientific article; zbMATH DE number 5761830 (Why is no real title available?)
• Combinatorial families that are exponentially far from being listable in Gray code sequence
• Gray code for Cayley permutations

This page was built for publication: More restrictive Gray codes for some classes of pattern avoiding permutations

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