Pages that link to "Item:Q879329"
From MaRDI portal
The following pages link to Gray code for permutations with a fixed number of cycles (Q879329):
Displaying 9 items.
- Gray codes and lexicographical combinatorial generation for nonnesting and sparse nonnesting set partitions (Q500971) (← links)
- Gray codes for signed involutions (Q724881) (← links)
- Combinatorial Gray codes for classes of pattern avoiding permutations (Q924132) (← links)
- Generating restricted classes of involutions, Bell and Stirling permutations (Q966165) (← links)
- More restrictive Gray codes for some classes of pattern avoiding permutations (Q989488) (← links)
- Gray codes, loopless algorithm and partitions (Q1040787) (← links)
- Tests and proofs for custom data generators (Q1624592) (← links)
- Loop-free Gray code algorithm for the \textbf{e}-restricted growth functions (Q1944946) (← links)
- The pure descent statistic on permutations (Q2012552) (← links)