Universal Cycles of Restricted Classes of Words

Abstract

It is well known that Universal 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 restricted classes of words, including: non-bijections, equitable words (under suitable restrictions), ranked permutations, and "passwords".

14 pages, replacement of previous version with more detailed proofs and some corrections

References in corpus (1)

• Universal Cycles of Discrete Functions

Cited by in corpus (1)

• Universal Cycles of Restricted Words