Universal Cycles of Restricted Classes of Words

Details Universal Cycles of Restricted Classes of Words Universal Cycles of Restricted Classes of Words

2008-08-08

arxiv.org/abs/0808.1309v2

Discrete Mathematics, 310, 3303-3309, (2010)

Mathematics

Combinatorics

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

Scientific paper

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".

Affiliated with

Also associated with

No associations

Rating

Universal Cycles of Restricted Classes of Words does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Universal Cycles of Restricted Classes of Words, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Universal Cycles of Restricted Classes of Words will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-11137