An algorithm for generating necklaces of beads in two colors
From MaRDI portal
Publication:1084396
DOI10.1016/0012-365X(86)90089-0zbMath0606.05003MaRDI QIDQ1084396
Irving J. Kessler, Harold Fredricksen
Publication date: 1986
Published in: Discrete Mathematics (Search for Journal in Brave)
Related Items (23)
A universal cycle for strings with fixed-content (which are also known as multiset permutations) ⋮ Generalizing the classic greedy and necklace constructions of de Bruijn sequences and universal cycles ⋮ Constructing de Bruijn sequences with co-lexicographic order: the \(k\)-ary grandmama sequence ⋮ Unnamed Item ⋮ Necklaces and Lyndon words in colexicographic and binary reflected Gray code order ⋮ A Gray code for fixed-density necklaces and Lyndon words in constant amortized time ⋮ Boltzmann samplers for \(v\)-balanced cycles ⋮ The lexicographically smallest universal cycle for binary strings with minimum specified weight ⋮ Constructing the first (and coolest) fixed-content universal cycle ⋮ A fast algorithm to generate necklaces with fixed content ⋮ Analysis of generating functions for special words and numbers and algorithms for computation ⋮ Derivative-free mixed binary necklace optimization for cyclic-symmetry optimal design problems ⋮ The coolest way to generate binary strings ⋮ Difference equations with delay ⋮ Witt vectors. Part 1 ⋮ Lexicographic compositions and de Bruijn sequences ⋮ A framework for constructing de Bruijn sequences via simple successor rules ⋮ Necklaces of beads in k colors and k-ary de Bruijn sequences ⋮ The Collatz conjecture and de Bruijn graphs ⋮ De Bruijn Sequences for the Binary Strings with Maximum Density ⋮ Efficient Ranking of Lyndon Words and Decoding Lexicographically Minimal de Bruijn Sequence ⋮ Charm bracelets and their application to the construction of periodic Golay pairs ⋮ Computation of k-ary Lyndon words using generating functions and their differential equations
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A class of nonlinear de Bruijn cycles
- Lexicographic compositions and de Bruijn sequences
- Necklaces of beads in k colors and k-ary de Bruijn sequences
- A proof of Golomb's conjecture for the de Bruijn graph
- On extremal factors of the de Bruijn graph
- A Survey of Full Length Nonlinear Shift Register Cycle Algorithms
- Generating and Counting the Double Adjacencies in a Pure Circulating Shift Register
- Double Adjacencies Between Cycles of a Circulating Shift Register
This page was built for publication: An algorithm for generating necklaces of beads in two colors
