An algorithm for generating necklaces of beads in two colors

DOI10.1016/0012-365X(86)90089-0zbMATH Open0606.05003MaRDI QIDQ1084396FDOQ1084396

Authors: Harold Fredricksen, Irving J. Kessler 

Publication date: 1986

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

Recommendations

• Generating necklaces
• A Gray Code for Necklaces of Fixed Density
• Publication:4952625
• A fast algorithm to generate necklaces with fixed content
• scientific article; zbMATH DE number 1305469

zbMATH Keywords

algorithmsnecklaces

Mathematics Subject Classification ID

Permutations, words, matrices (05A05)

Cites Work

• Necklaces of beads in k colors and k-ary de Bruijn sequences
• Title not available (Why is that?)
• Title not available (Why is that?)
• A proof of Golomb's conjecture for the de Bruijn graph
• A Survey of Full Length Nonlinear Shift Register Cycle Algorithms
• A class of nonlinear de Bruijn cycles
• Lexicographic compositions and de Bruijn sequences
• Title not available (Why is that?)
• On extremal factors of the de Bruijn graph
• Generating and Counting the Double Adjacencies in a Pure Circulating Shift Register
• Double Adjacencies Between Cycles of a Circulating Shift Register

Cited In (31)

• A Gray code for fixed-density necklaces and Lyndon words in constant amortized time
• Boltzmann samplers for \(v\)-balanced cycles
• The Collatz conjecture and de Bruijn graphs
• A universal cycle for strings with fixed-content (which are also known as multiset permutations)
• The lexicographically smallest universal cycle for binary strings with minimum specified weight
• A fast algorithm to generate necklaces with fixed content
• Decomposition of necklaces
• Witt vectors. I
• Constructing de Bruijn sequences with co-lexicographic order: the \(k\)-ary grandmama sequence
• Counting colorful necklaces and bracelets in three colors
• Derivative-free mixed binary necklace optimization for cyclic-symmetry optimal design problems
• Generalizing the classic greedy and necklace constructions of de Bruijn sequences and universal cycles
• Lexicographic compositions and de Bruijn sequences
• Constructing the first (and coolest) fixed-content universal cycle
• Analysis of generating functions for special words and numbers and algorithms for computation
• Necklaces and Lyndon words in colexicographic and binary reflected Gray code order
• De Bruijn sequences for the binary strings with maximum density
• Difference necklaces
• Charm bracelets and their application to the construction of periodic Golay pairs
• Difference equations with delay
• An Efficient Algorithm for Generating Necklaces with Fixed Density
• Efficient ranking of Lyndon words and decoding lexicographically minimal de Bruijn sequence
• The coolest way to generate binary strings
• Generating generalized necklaces and new quasi-cyclic codes
• Generating necklaces
• The Necklace Process
• Title not available (Why is that?)
• Computation of k-ary Lyndon words using generating functions and their differential equations
• AN ALGORITHM TO CONSTRUCT THE LE DIAGRAM ASSOCIATED TO A GRASSMANN NECKLACE
• Necklaces of beads in k colors and k-ary de Bruijn sequences
• A framework for constructing de Bruijn sequences via simple successor rules

This page was built for publication: An algorithm for generating necklaces of beads in two colors

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1084396)