An inductive approach to constructing universal cycles on the \(k\)-subsets of \([n]\) (Q1953498): Difference between revisions

Summary: In this paper, we introduce a method of constructing universal cycles on sets by taking ``sums'' and ``products'' of smaller cycles. We demonstrate this new approach by proving that if there exist universal cycles on the 4-subsets of [18] and the 4-subsets of [26], then for any integer \(n \geq 18\), \(n \equiv 2 \pmod{8}\), there exists a universal cycle on the 4-subsets of \([n]\).