Return to search

Universal Cycles of Classes of Restricted Words

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.

Identiferoai:union.ndltd.org:ETSU/oai:dc.etsu.edu:etsu-works-17962
Date06 December 2010
CreatorsLeitner, Arielle, Godbole, Anant P.
PublisherDigital Commons @ East Tennessee State University
Source SetsEast Tennessee State University
Detected LanguageEnglish
Typetext
SourceETSU Faculty Works

Page generated in 0.0018 seconds