Combinatorial Gray codes for classes of pattern avoiding permutations
From MaRDI portal
Publication:924132
DOI10.1016/j.tcs.2007.12.002zbMath1138.68042arXiv0704.2048OpenAlexW2028018202MaRDI QIDQ924132
W. M. B. Dukes, M. F. Flanagan, Vicentiu Vajnovszki, Toufik Mansour
Publication date: 28 May 2008
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/0704.2048
Nonnumerical algorithms (68W05) Combinatorics in computer science (68R05) Permutations, words, matrices (05A05)
Related Items (6)
Gray coding cubic planar maps ⋮ Gray codes and lexicographical combinatorial generation for nonnesting and sparse nonnesting set partitions ⋮ Generating restricted classes of involutions, Bell and Stirling permutations ⋮ Exhaustive generation for permutations avoiding (colored) regular sets of patterns ⋮ More restrictive Gray codes for some classes of pattern avoiding permutations ⋮ Combinatorial generation via permutation languages. I. Fundamentals
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Gray code for permutations with a fixed number of cycles
- A general exhaustive generation algorithm for Gray structures
- Generating permutations with given ups and downs
- Generating permutations of a bag by interchanges
- Forbidden subsequences and Chebyshev polynomials
- Gray visiting Motzkins
- Postscript: ``Permutations with forbidden subsequences and a generalized Schröder number [Discrete Mathematics 218 (2000) 121--130]
- Gray code for derangements
- Permutations which avoid 1243 and 2143, continued fractions, and Chebyshev polynomials
- A loopless algorithm for generating the permutations of a multiset
- Exhaustive generation of combinatorial objects by ECO
- Generating trees and the Catalan and Schröder numbers
- Permutations with forbidden subsequences and a generalized Schröder number
- Short notes: Some Properties of the Rotation Lattice of Binary Trees
- A Survey of Combinatorial Gray Codes
- Loopless Algorithms for Generating Permutations, Combinations, and Other Combinatorial Configurations
- Loopless generation of up-down permutations
This page was built for publication: Combinatorial Gray codes for classes of pattern avoiding permutations
