Faster Generation of Shorthand Universal Cycles for Permutations

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

• Type: Conference
• Year: 2010
• Where: COCOON
• Authors: Alexander E. Holroyd, Frank Ruskey, Aaron Williams
• Keywords: Circular String, COCOON 2010, Combinatorics, Universal Cycle