- On a Greedy Algorithm to Construct Universal Cycles for Permutations🔍
- De Bruijn Sequence and Universal Cycle Constructions🔍
- Universal cycles of 🔍
- Universal Cycle Packings and Coverings for k|Subsets of an n|Set🔍
- Compression and Connections to Universal Cycles🔍
- Near|Universal Cycles for Subsets Exist🔍
- On universal partial words for word|patterns and set partitions🔍
- Research problems on Gray codes and universal cycles🔍
Universal and Near|Universal Cycles of Set Partitions
On a Greedy Algorithm to Construct Universal Cycles for Permutations
consider the partition of the symmetric group Sn = S1,n ∪ Sn,1, where ... An explicit universal cycle for the (n − 1)- permutations of an n-set. ACM ...
De Bruijn Sequence and Universal Cycle Constructions
It is easy to demonstrate that UCs for permutations in their standard one-line notation do not exist [Joh09]. However, there are several known UC constructions ...
Universal cycles of (n−1)-partitions of an n-set - CORE
Abstract. AbstractIn 1992 Chung, Diaconis and Graham generalized de Bruijn cycles to other combinatorial families with universal cycles. Universal cycles ...
Universal Cycle Packings and Coverings for k-Subsets of an n-Set
They are closely related to both de Bruijn cycles and Gray codes. A universal cycle is a cyclic sequence which contains as a subsequence of ...
Compression and Connections to Universal Cycles - arXiv
... universal cycles for sets, multisets, permutations, permutation involutions, and set partitions by encoding them as graphs. In Section 6, by.
Near-Universal Cycles for Subsets Exist | SIAM Journal on Discrete ...
Let S be a cyclic n-ary sequence. We say that S is a universal cycle ( ( n , k ) -Ucycle) for k-subsets of [ n ] if every such subset appears exactly once ...
On universal partial words for word-patterns and set partitions - CORE
Abstract. Universal words are words containing exactly once each element from a given set of combinatorial structures admiting encoding by words.
Research problems on Gray codes and universal cycles
... set", ACM Trans. on Algorithms to appear, 2009. PROBLEM 478. Universal Cycles for Partitions of an n-Set. Persi Diaconis. Depts. of Statistics and Mathematics ...
Item – Theses Canada - Canada.ca
OCLC number: 60739113 · Link(s) to full text: LAC copy · Author: Casteels, Karel,1979- · Title: Universal cycles for (n - 1)-partitions of an n-set. · Degree: M. Sc ...
A successor rule framework for constructing k-ary de Bruijn ...
The following lemma describes when two universal cycles can be joined together to create a universal cycle ... If the largest set in the UC-partition of Σn.
Toufik Mansour's books: Combinatorics of Set Partitions
Sieben, A. Godbole, Universal and Near-Universal Cycles of Set Partitions, arXiv, http://arxiv.org/pdf/1502.04076.pdf 3. S. Dahlberg, R. Dorward, J. Gerhard ...
Universal Cycles for Weak Orders | SIAM Journal on Discrete ...
Universal cycles are generalizations of de Bruijn cycles and Gray codes that were introduced originally by Chung, Diaconis, and Graham in 1992.
On Universal Cycles for new Classes of Combinatorial Structures
We study universal cycles of the set ${\cal P}(n,k)$ of $k$-partitions of the set $[n]:=\{1,2,\ldots,n\}$ and ...
On universal partial words for word-patterns and set partitions
... cycles for words and permutations. We apply methods of graph theory and combinatorics on words to obtain our results. Mathematics Subject Classification ...
#2727 - Universal cycles for permutation classes
... situation when the class is defined as the avoidance class of a set of permutations of length $3$, or of a set of permutations of mixed lengths $3$ and $4$.
Efficient universal cycle constructions for weak orders, Discrete Mathematics 343.10 (2020): 112022. ... set partitions are: 01: [ 1 1 1 ] { 1, 2, 3 }. 02: [ 1 1 ...
(PDF) Random Set Partitions: Asymptotics of Subset Counts
Random Set Partitions: Asymptotics of Subset Counts by Boris Pittel ... Universal and Near-Universal Cycles of Set Partitions. Electronic Journal of ...
Chapter 3: Partitions and counting - Dartmouth College Mathematics
described in terms of partitions of a set. ... 20 and 10 per 100,000.] 6. Let A, B, and C be any three sets of a universal set u. Draw a Venn diagram and show ...
2.3: Partitions of Sets and the Law of Addition
We see that the whole universal set is naturally partitioned into ... How many ways can you complete your schedule if your only open periods are 9 ...
On universal partial words for word-patterns and set partitions
... cycles for words and permutations. We apply methods of graph theory and combinatorics on words to obtain our results. Original language ...