More restrictive Gray codes for some classes of pattern avoiding permutations
From MaRDI portal
Publication:989488
DOI10.1016/j.ipl.2009.03.025zbMath1202.68271OpenAlexW4300882835MaRDI QIDQ989488
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
algorithmsCatalan numbersSchröder numbersGray codecentral binomial coefficientspattern avoiding permutationgenerating algorithm
Nonnumerical algorithms (68W05) Combinatorics in computer science (68R05) Permutations, words, matrices (05A05)
Related Items
Gray codes and lexicographical combinatorial generation for nonnesting and sparse nonnesting set partitions ⋮ Combinatorial generation via permutation languages. I. Fundamentals
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Generating alternating permutations lexicographically
- Gray code for permutations with a fixed number of cycles
- Combinatorial Gray codes for classes of pattern avoiding permutations
- A general exhaustive generation algorithm for Gray structures
- A CAT algorithm for generating permutations with a fixed number of inversions
- Generating permutations with given ups and downs
- Forbidden subsequences and Chebyshev polynomials
- Gray visiting Motzkins
- Gray code for derangements
- A loopless algorithm for generating the permutations of a multiset
- Generating trees and the Catalan and Schröder numbers
- Permutations with forbidden subsequences and a generalized Schröder number
- From Motzkin to Catalan permutations
- Constant time generation of derangements
- A new algorithm for generating derangements
- ECO:a methodology for the enumeration of combinatorial objects
- Generation of Permutations by Adjacent Transposition
- Restricted permutations
- Loopless generation of up-down permutations
