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
Equivalence class universal cycles for permutations
โ Scribed by Glenn Hurlbert; Garth Isaak
- Publisher
- Elsevier Science
- Year
- 1996
- Tongue
- English
- Weight
- 268 KB
- Volume
- 149
- Category
- Article
- ISSN
- 0012-365X
No coin nor oath required. For personal study only.
โฆ Synopsis
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.
๐ SIMILAR VOLUMES
In this paper, we construct a cycle permutation graph as a covering graph over the dumbbell graph, and give a new characterization of when two given cycle permutation graphs are isomorphic by a positive or a negative natural isomorphism. Also, we count the isomorphism classes of cycle permutation gr
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
Let u be a positive integer and Z, the residue class ring modulo U. Two subsets D1 and D, of Z, are said to be equivalent if there exist t,seZ, with gcd(t, v)= 1 such that D, = tD, +s. We are interested in the number of equivalence classes of k-subsets of 2, and the number of equivalence classes of