Pages that link to "Item:Q989488"
From MaRDI portal
The following pages link to More restrictive Gray codes for some classes of pattern avoiding permutations (Q989488):
Displaying 14 items.
- Gray codes and lexicographical combinatorial generation for nonnesting and sparse nonnesting set partitions (Q500971) (← links)
- Gray code for permutations with a fixed number of cycles (Q879329) (← links)
- Combinatorial Gray codes for classes of pattern avoiding permutations (Q924132) (← links)
- Gray code for Cayley permutations (Q1884342) (← links)
- Strings from linear recurrences and permutations: a gray code (Q2089698) (← links)
- Optimal Gray code for involutions (Q2419799) (← links)
- An efficient Gray code algorithm for generating all permutations with a given major index (Q2447540) (← links)
- A Gray code for permutations of size \(2d\) with \(d\) descents (Q2915596) (← links)
- (Q3098785) (← links)
- (Q3575463) (← links)
- Combinatorial families that are exponentially far from being listable in Gray code sequence (Q4216327) (← links)
- A Survey of Combinatorial Gray Codes (Q4376203) (← links)
- Combinatorial generation via permutation languages. I. Fundamentals (Q5863047) (← links)
- On the hardness of Gray code problems for combinatorial objects (Q6575387) (← links)
