More restrictive Gray codes for some classes of pattern avoiding permutations
DOI10.1016/J.IPL.2009.03.025zbMATH Open1202.68271OpenAlexW4300882835MaRDI QIDQ989488FDOQ989488
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
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
algorithmsGray codeCatalan numberscentral binomial coefficientspattern avoiding permutationgenerating algorithmSchröder numbers
Permutations, words, matrices (05A05) Combinatorics in computer science (68R05) Nonnumerical algorithms (68W05)
Cites Work
- Restricted permutations
- Title not available (Why is that?)
- Generating trees and the Catalan and Schröder numbers
- Generating permutations with given ups and downs
- Generation of Permutations by Adjacent Transposition
- Generating alternating permutations lexicographically
- ECO:a methodology for the enumeration of combinatorial objects
- A general exhaustive generation algorithm for Gray structures
- Permutations with forbidden subsequences and a generalized Schröder number
- From Motzkin to Catalan permutations
- Gray visiting Motzkins
- Gray code for derangements
- Gray codes for involutions
- Gray code for permutations with a fixed number of cycles
- Combinatorial Gray codes for classes of pattern avoiding permutations
- Forbidden subsequences and Chebyshev polynomials
- A loopless algorithm for generating the permutations of a multiset
- A CAT algorithm for generating permutations with a fixed number of inversions
- Loopless generation of up-down permutations
- From Fibonacci to Catalan permutations
- A new algorithm for generating derangements
- Constant time generation of derangements
Cited In (15)
- Combinatorial generation via permutation languages. I. Fundamentals
- A Gray code for permutations of size \(2d\) with \(d\) descents
- On the hardness of Gray code problems for combinatorial objects
- An efficient Gray code algorithm for generating all permutations with a given major index
- A Survey of Combinatorial Gray Codes
- Gray code for permutations with a fixed number of left-to-right minima.
- Title not available (Why is that?)
- 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
- Title not available (Why is that?)
- 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)
