This site uses cookies to deliver our services and to ensure you get the best experience. By continuing to use this site, you consent to our use of cookies and acknowledge that you have read and understand our Privacy Policy, Cookie Policy, and Terms
A universal cycle for the k-permutations of n = {1, 2, ..., n} is a circular string of length nk that contains each k-permutation exactly once as a substring. Jackson (Discrete Mathematics, 149
Alexander E. Holroyd, Frank Ruskey, Aaron Williams