A Universal Cycle for t-multisets of [n] = {1, . . . , n} is a cyclic sequence of ( n+t−1 t ) integers from [n] with the property that each tmultiset of [n] appears exactly once consecutively in the… (More)

We consider the distribution of cycle counts in a random regular graph, which is closely linked to the graph’s spectral properties. We broaden the asymptotic regime in which the cycle counts are… (More)

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… (More)

A Universal Cycle for t-multisets of [n] = {1, . . . , n} is a cyclic sequence of ( n+t−1 t ) integers from [n] with the property that each tmultiset of [n] appears exactly once consecutively in the… (More)