2026-07-072026-07-07http://salesiana.dossiersoluciones.com/handle/123456789/141075A universal cycle for permutations is a word of length n! such that each of the n! possible relative orders of n distinct integers occurs as a cyclic interval of the word. We show how to construct such a universal cycle in which only n+1 distinct integers are used. This is best possible and proves a conjecture of Chung, Diaconis and Graham.14 pages, 2 figuresCombinatorics05A99text