Gray code for Cayley permutations
From MaRDI portal
Publication:1884342
zbMATH Open1053.05001MaRDI QIDQ1884342FDOQ1884342
Authors: Jean-Luc Baril
Publication date: 28 October 2004
Published in: Computer Science Journal of Moldova (Search for Journal in Brave)
Recommendations
- Gray code for permutations with a fixed number of cycles
- Note on Gray codes for permutation lists
- Combinatorial Gray codes for classes of pattern avoiding permutations
- Gray code for derangements
- A Gray code for permutations of size \(2d\) with \(d\) descents
- Permutational labelling of constant weight Gray codes
- Gray code for permutations with a fixed number of left-to-right minima.
- More restrictive Gray codes for some classes of pattern avoiding permutations
- Gray codes for reflection groups
- Gray codes and symmetric chains
Cited In (6)
- A Gray code for permutations of size \(2d\) with \(d\) descents
- Gray code for permutations with a fixed number of left-to-right minima.
- Cayley permutations
- A loopless implementation of a gray code for signed permutations
- Doubly adjacent gray codes for the symmetric group
- Generating Gray codes for weak orders in constant amortized time
This page was built for publication: Gray code for Cayley permutations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1884342)