Generating necklaces
From MaRDI portal
Recommendations
- A fast algorithm to generate necklaces with fixed content
- scientific article; zbMATH DE number 1305469
- An Efficient Algorithm for Generating Necklaces with Fixed Density
- Publication:4952625
- The Necklace Process
- Generating bracelets with fixed content
- Reconstructing Odd Necklaces
- An algorithm for generating necklaces of beads in two colors
- A random necklace model
- ENUMERATING NECKLACES WITH TRANSITIONS
Cited in
(49)- A Gray code for fixed-density necklaces and Lyndon words in constant amortized time
- Many body density of states of a system of non interacting spinless fermions
- Necklaces, Convolutions, and X + Y
- A random necklace model
- The lexicographically smallest universal cycle for binary strings with minimum specified weight
- More restrictive Gray codes for necklaces and Lyndon words
- A fast algorithm to generate necklaces with fixed content
- On the generation of aperiodic and periodic necklaces via T-augmentation
- Enumerating words with forbidden factors
- Practical algorithms to rank necklaces, Lyndon words, and de Bruijn sequences
- An efficient shift rule for the prefer-max de Bruijn sequence
- Generating bracelets with fixed content
- Constructing de Bruijn sequences with co-lexicographic order: the \(k\)-ary grandmama sequence
- Minimum Eulerian circuits and minimum de Bruijn sequences
- Generalizing the classic greedy and necklace constructions of de Bruijn sequences and universal cycles
- ENUMERATING NECKLACES WITH TRANSITIONS
- Perfect necklaces
- On prefix normal words and prefix normal forms
- The k-centre problem for classes of cyclic words
- An efficient generalized shift-rule for the prefer-max de Bruijn sequence
- A characterization of binary morphisms generating Lyndon infinite words
- Necklaces and Lyndon words in colexicographic and binary reflected Gray code order
- Loopless algorithms to generate maximum length Gray cycles wrt. \(k\)-character substitutions
- De Bruijn sequences for the binary strings with maximum density
- On infinite prefix normal words
- Reconstructing Odd Necklaces
- Difference necklaces
- Constructing de Bruijn sequences by concatenating smaller universal cycles
- Symmetric itinerary sets: algorithms and nonlinear examples
- Completely uniformly distributed sequences based on de Bruijn sequences
- Constructing new covering arrays from LFSR sequences over finite fields
- Generalized de Bruijn words for primitive words and powers
- Certain classes of combinatorial polynomials involving (inverse) binomial coefficients with their applications
- Average cost of Duval's algorithm for generating Lyndon words
- Listing words in free groups
- 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
- Efficient indexing of necklaces and irreducible polynomials over finite fields
- An asymptotic equality for the number of necklaces in a shuffle-exchange network
- \(k\)-ary Lyndon words and necklaces arising as rational arguments of Hurwitz-Lerch zeta function and Apostol-Bernoulli polynomials
- de Bruijn sequences and de Bruijn graphs for a general language
- scientific article; zbMATH DE number 1305469 (Why is no real title available?)
- scientific article; zbMATH DE number 1445312 (Why is no real title available?)
- scientific article; zbMATH DE number 1696649 (Why is no real title available?)
- Generating fixed density bracelets of arbitrary base
- Necklaces, convolutions, and \(X+Y\)
- Gray cycles of maximum length related to \(k\)-character substitutions
This page was built for publication: Generating necklaces
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4020354)
