Universal cycles for combinatorial structures

DOI10.1016/0012-365X(92)90699-GzbMath0776.05001WikidataQ29041464 ScholiaQ29041464MaRDI QIDQ1208348

Persi Diaconis, Fan R. K. Chung, Ronald L. Graham

Publication date: 16 May 1993

Published in: Discrete Mathematics (Search for Journal in Brave)

zbMATH Keywords

partitions; permutations; universal cycle; De Bruijn cycles

Mathematics Subject Classification ID

05A18: Partitions of sets

05A05: Permutations, words, matrices

05C38: Paths and cycles

05C20: Directed graphs (digraphs), tournaments

05C45: Eulerian and Hamiltonian graphs

Related Items

Universal cycles of \(k\)-subsets and \(k\)-permutations, On the de Bruijn torus problem, Hamiltonian decompositions of complete \(k\)-uniform hypergraphs, Universal cycles of classes of restricted words, Growing perfect cubes, de Bruijn sequences and de Bruijn graphs for a general language, Universal cycles for permutations, Minimum Eulerian circuits and minimum de Bruijn sequences, On universal cycles for multisets, A recursive construction for universal cycles of 2-subspaces, Universal cycles of \((n - 1)\)-partitions of an \(n\)-set, Hamiltonian paths in Cayley graphs, Multicover Ucycles, Path-sequential labellings of cycles, The combinatorics of binary arrays, New classes of perfect maps. I, Equivalence class universal cycles for permutations, On uniquely \(k\)-determined permutations, De Bruijn Sequences for the Binary Strings with Maximum Density

Cites Work

• Universal tilings of the plane by 0-1 -matrices
• Universal tilings and universal (0,1)-matrices
• Toroidal tilings from de Bruijn-Good cyclic sequences
• Construction of infinite de Bruijn arrays
• m-ary closed sequences
• Binary Ring Sequences
• A Survey of Full Length Nonlinear Shift Register Cycle Algorithms
• On Pseudo-Random Arrays
• A problem in arrangements
• Oriented subtrees of an arc digraph
• A theory of two-dimensional linear recurring arrays
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item