Pages that link to "Item:Q1759661"
From MaRDI portal
The following pages link to Shorthand universal cycles for permutations (Q1759661):
Displayed 17 items.
- The lexicographically smallest universal cycle for binary strings with minimum specified weight (Q405571) (← links)
- A universal cycle for strings with fixed-content (which are also known as multiset permutations) (Q832908) (← links)
- Successor rules for flipping pancakes and burnt pancakes (Q897860) (← links)
- Universal cycles for permutations (Q1044883) (← links)
- Computing generalized de Bruijn sequences (Q1680534) (← links)
- On universal partial words (Q1689916) (← links)
- A new universal cycle for permutations (Q1696522) (← links)
- Gray codes and symmetric chains (Q2072179) (← links)
- Shortened universal cycles for permutations (Q2097185) (← links)
- Enumerations of universal cycles for \(k\)-permutations (Q2144520) (← links)
- Generalizing the classic greedy and necklace constructions of de Bruijn sequences and universal cycles (Q2635088) (← links)
- (Q5002744) (← links)
- Sparse Kneser graphs are Hamiltonian (Q5006324) (← links)
- On a Combinatorial Generation Problem of Knuth (Q5080484) (← links)
- Containing All Permutations (Q5144492) (← links)
- On a Greedy Algorithm to Construct Universal Cycles for Permutations (Q5384431) (← links)
- Constructing the first (and coolest) fixed-content universal cycle (Q6103527) (← links)