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
โฆ LIBER โฆ
Near-Universal Cycles for Subsets Exist
โ Scribed by Curtis, Dawn; Hines, Taylor; Hurlbert, Glenn; Moyer, Tatiana
- Book ID
- 118197765
- Publisher
- Society for Industrial and Applied Mathematics
- Year
- 2009
- Tongue
- English
- Weight
- 184 KB
- Volume
- 23
- Category
- Article
- ISSN
- 0895-4801
No coin nor oath required. For personal study only.
๐ SIMILAR VOLUMES
Universal cycles of k-subsets and k-perm
โ
B.W. Jackson
๐
Article
๐
1993
๐
Elsevier Science
๐
English
โ 701 KB
Universal cycles for permutations
โ
J. Robert Johnson
๐
Article
๐
2009
๐
Elsevier Science
๐
English
โ 455 KB
Universal cycles for combinatorial struc
โ
Fan Chung; Persi Diaconis; Ron Graham
๐
Article
๐
1992
๐
Elsevier Science
๐
English
โ 836 KB
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
On universal cycles for multisets
โ
Glenn Hurlbert; Tobias Johnson; Joshua Zahl
๐
Article
๐
2009
๐
Elsevier Science
๐
English
โ 490 KB
Equivalence class universal cycles for p
โ
Glenn Hurlbert; Garth Isaak
๐
Article
๐
1996
๐
Elsevier Science
๐
English
โ 268 KB
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 traversal sequences for paths
โ
Michael F Bridgland
๐
Article
๐
1987
๐
Elsevier Science
๐
English
โ 552 KB