We construct a universal cycle of n-permutations using n + 1 symbols and an equivalence relation based on differences. Moreover a complete family of universal cycles of this kind is constructed.
Universal cycles for permutations
โ Scribed by J. Robert Johnson
- Book ID
- 108113952
- Publisher
- Elsevier Science
- Year
- 2009
- Tongue
- English
- Weight
- 455 KB
- Volume
- 309
- Category
- Article
- ISSN
- 0012-365X
No coin nor oath required. For personal study only.
๐ SIMILAR VOLUMES
In this paper the author constructs universal cycles of 3-subsets of an n-set for n 28 and (n, 3)= 1, verifying a conjecture of Chung et al. ( ) for 3-subsets. Universal cycles of 4-subsets of an n-set for n > 8 and (n, 4) = 1 are also constructed, partially solving the same conjecture for 4-subsets
Chung, F., P. Diaconis and R. Graham, Universal cycles for combinatorial structures, Discrete Mathematics 110 (1992) 43-59 In this paper, we explore generalizations of de Bruijn cycles for a variety of families of combinatorial structures, including permutations, partitions and subsets of a finite