Universal Cycles on 3-Multisets

Details Universal Cycles on 3-Multisets Universal Cycles on 3-Multisets

2006-08-30

arxiv.org/abs/math/0608769v1

Mathematics

Combinatorics

6 pages

Scientific paper

Consider the collection of all t-multisets of {1,...,n}. A universal cycle on multisets is a string of numbers, each of which is between 1 and n, such that if these numbers are considered in t-sized windows, every multiset in the collection is present in the string precisely once. The problem of finding necessary and sufficient conditions on n and t for the existence of universal cycles and similar combinatorial structures was first addressed by DeBruijn in 1946 (who considered t-tuples instead of t-multisets). The past 15 years has seen a resurgence of interest in this area, primarily due to Chung, Diaconis, and Graham's 1992 paper on the subject. For the case t=3, we determine necessary and sufficient conditions on n for the existence of universal cycles, and we examine how this technique can be generalized to other values of t.

Affiliated with

Also associated with

No associations

Rating

Universal Cycles on 3-Multisets 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 on 3-Multisets, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Universal Cycles on 3-Multisets will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-397512