s-overlap cycles for permutations

MaRDI QIDQ2948802zbMATH OpenFDO

Authors Victoria Horan, Glenn H. Hurlbert

Publication date 6 October 2015

Full work available at URL https://arxiv.org/abs/1301.1270

Mathematics Subject Classification ID

Permutations, words, matrices (05A05)

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.

Recommendations

• Overlap cycles for permutations: necessary and sufficient conditions
• Enumerating cycles in the graph of overlapping permutations
• Universal cycles for weak orders
• Generalized de Bruijn cycles
• 1-overlap cycles for Steiner triple systems

Cited in

(7)

• Shortened universal cycles for permutations
• Adjacent \(q\)-cycles in permutations
• Overlap cycles for permutations: necessary and sufficient conditions
• Enumerating cycles in the graph of overlapping permutations
• Graph universal cycles: compression and connections to universal cycles
• Universal cycle packings and coverings for \(k\)-subsets of an \(n\)-set
• Universal and overlap cycles for posets, words, and juggling patterns

This page was built for publication: \(s\)-overlap cycles for permutations

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2948802)