On a Greedy Algorithm to Construct Universal Cycles for Permutations

Alice L. L. Gao, Sergey Kitaev, Wolfgang Steiner +1

A universal cycle for permutations of length $n$ is a cyclic word or permutation, any factor of which is order-isomorphic to exactly one permutation of length $n$, and containing a…