Abstract

Universal cycle for k-permutations is a cyclic arrangement in which each k-permutation appears exactly once as k consecutive elements. Enumeration problem of universal cycles for k-permutations is discussed and one new enumerating method is proposed in this paper. Accurate enumerating formulae are provided when k=2,3.

Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call