Pages that link to "Item:Q2930325"
From MaRDI portal
The following pages link to An explicit universal cycle for the ( <i>n</i> -1)-permutations of an <i>n</i> -set (Q2930325):
Displaying 17 items.
- The lexicographically smallest universal cycle for binary strings with minimum specified weight (Q405571) (← links)
- Universal cycles of classes of restricted words (Q712255) (← 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)
- A new universal cycle for permutations (Q1696522) (← links)
- Shorthand universal cycles for permutations (Q1759661) (← 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)
- Designing preference functions for de Bruijn sequences with forbidden words (Q2673980) (← links)
- Hamilton Cycles in Restricted and Incomplete Rotator Graphs (Q3144121) (← links)
- On Universal Cycles for <i>k</i>-Subsets of an <i>n</i>-Set (Q4317705) (← links)
- Containing All Permutations (Q5144492) (← links)
- On a Greedy Algorithm to Construct Universal Cycles for Permutations (Q5384431) (← links)
- Syntactic view of sigma-tau generation of permutations (Q5918363) (← links)
- Constructing the first (and coolest) fixed-content universal cycle (Q6103527) (← links)
- Constant time and space updates for the sigma-tau problem (Q6545441) (← links)
