Abstract :
A Universal Cycle, or Ucycle, for k-subsets of [n]=1, 2, …, n is a cyclic sequence of (kn) integers with the property that every k subset of [n] appears exactly once consecutively in the sequence. A t-cover Ucycle for k-subsets of [n] is a cyclic sequence of t(kn) integers with the property that every k-subset of [n] appears exactly t times consecutively in the sequence. Here we investigate the minimal number t=U(n, k) for which there is a t-cover Ucycle.
