Abstract: A Universal Cycle for t-multisets of [n]={1,...,n} is a cyclic sequence of integers from [n] with the property that each t-multiset of [n] appears exactly once consecutively in the sequence. For such a sequence to exist it is necessary that n divides , and it is reasonable to conjecture that this condition is sufficient for large enough n in terms of t. We prove the conjecture completely for t in {2,3} and partially for t in {4,6}. These results also support a positive answer to a question of Knuth.
Recommendations
- On Universal Cycles for k-Subsets of an n-Set
- Universal and near-universal cycles of set partitions
- On universal cycles for new classes of combinatorial structures
- Universal cycles for combinatorial structures
- Universal cycles of k-subsets and k-permutations
- Universal cycles of \((n - 1)\)-partitions of an \(n\)-set
- CYCLIC DECOMPOSITIONS OF MULTISETS
- Universal cycles for permutation classes
- An inductive approach to constructing universal cycles on the \(k\)-subsets of \([n]\)
- Near-universal cycles for subsets exist
Cites work
Cited in
(5)- An inductive approach to constructing universal cycles on the \(k\)-subsets of \([n]\)
- On Universal Cycles for k-Subsets of an n-Set
- A recursive construction for universal cycles of 2-subspaces
- De Bruijn sequences for the binary strings with maximum density
- Universal cycle packings and coverings for \(k\)-subsets of an \(n\)-set
This page was built for publication: On universal cycles for multisets
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1044893)
