The following pages link to Universal cycles for weak orders (Q2870511):
Displaying 11 items.
- Universal and overlap cycles for posets, words, and juggling patterns (Q293633) (← links)
- The lexicographically smallest universal cycle for binary strings with minimum specified weight (Q405571) (← links)
- Universal cycle packings and coverings for \(k\)-subsets of an \(n\)-set (Q503623) (← links)
- Greedy universal cycle constructions for weak orders (Q779233) (← links)
- Efficient universal cycle constructions for weak orders (Q785821) (← links)
- A universal cycle for strings with fixed-content (which are also known as multiset permutations) (Q832908) (← links)
- Graph universal cycles of combinatorial objects (Q2020052) (← links)
- Shortened universal cycles for permutations (Q2097185) (← links)
- 1-overlap cycles for Steiner triple systems (Q2249792) (← links)
- Universal Cycles of Discrete Functions (Q3616008) (← links)
- Constructing the first (and coolest) fixed-content universal cycle (Q6103527) (← links)
