2000 character limit reached
s-Overlap Cycles for Permutations (1301.1270v2)
Published 7 Jan 2013 in math.CO
Abstract: The goal of this paper is to solve Problem 481 from the list of research problems in the special issue of Discrete Mathematics dedicated to the Banff International Research Station workshop on "Generalizations of de Bruijn Cycles and Gray Codes" in 2004. Overlap cycles are generalizations of de Bruijn cycles and Gray codes that were introduced originally in 2010 by Godbole et al. In this paper we prove that s-overlap cycles for k-permutations of [n] exist for all k<n.
Collections
Sign up for free to add this paper to one or more collections.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
