Overlap Cycles for Permutations: Necessary and Sufficient Conditions

Victoria Horan

Published 2013-09-18Version 1

Universal cycles are generalizations of de Bruijn cycles and Gray codes that were introduced originally by Chung, Diaconis, and Graham in 1992. They have been developed by many authors since, for various combinatorial objects such as strings, subsets, permutations, partitions, vector spaces, and designs. One generalization of universal cycles, which require almost complete overlap of consecutive words, is $s$-overlap cycles, which relax such a constraint. In this paper we study permutations and some closely related class of strings, namely juggling sequences and functions. We prove the existence of $s$-overlap cycles for these objects, as they do not always lend themselves to the universal cycle structure.