๐”– Bobbio Scriptorium
โœฆ   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

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

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.