Title
Universal Cycles of Classes of Restricted Words
Document Type
Article
Publication Date
12-6-2010
Description
It is well known that Universal cycles (U-cycles) of k-letter words on an n-letter alphabet exist for all k and n. In this paper, we prove that Universal cycles exist for several restricted classes of words, including non-bijections, "equitable" words (under suitable restrictions), ranked permutations, and "passwords". In each case, proving the connectedness of the underlying de Bruijn digraph is a non-trivial step.
Citation Information
Leitner, Arielle; and Godbole, Anant P.. 2010. Universal Cycles of Classes of Restricted Words. Discrete Mathematics. Vol.310(23). 3303-3309. https://doi.org/10.1016/j.disc.2010.07.016 ISSN: 0012-365X