Universal cycles for permutations

Simple item page
dc.creatorJohnson, J. Robert
dc.date2007-10-30
dc.date.accessioned2026-07-07T08:39:27Z
dc.date.available2026-07-07T08:39:27Z
dc.descriptionA 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.
dc.description14 pages, 2 figures
dc.identifierhttps://arxiv.org/abs/0710.5611
dc.identifierhttp://arxiv.org/abs/0710.5611
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/141075
dc.subjectCombinatorics
dc.subject05A99
dc.titleUniversal cycles for permutations
dc.typetext

Files

Collections

arXiv