English

Near universal cycles for subsets exist

Combinatorics 2008-09-23 v1

Abstract

Let S be a cyclic n-ary sequence. We say that S is a {\it universal cycle} ((n,k)-Ucycle) for k-subsets of [n] if every such subset appears exactly once contiguously in S, and is a Ucycle packing if every such subset appears at most once. Few examples of Ucycles are known to exist, so the relaxation to packings merits investigation. A family {S_n} of (n,k)-Ucycle packings for fixed k is a near-Ucycle if the length of S_n is (1o(1))(nk)(1-o(1))\binom{n}{k}. In this paper we prove that near-(n,k)-Ucycles exist for all k.

Keywords

Cite

@article{arxiv.0809.3725,
  title  = {Near universal cycles for subsets exist},
  author = {Dawn Curtis and Taylor Hines and Glenn Hurlbert and Tatiana Moyer},
  journal= {arXiv preprint arXiv:0809.3725},
  year   = {2008}
}

Comments

14 pages, 3 figures

R2 v1 2026-06-21T11:22:50.365Z