An Efficient Algorithm for Generating Necklaces with Fixed Density
From MaRDI portal
Recommendations
- scientific article; zbMATH DE number 1305469
- A fast algorithm to generate necklaces with fixed content
- scientific article; zbMATH DE number 1445312
- An algorithm for generating necklaces of beads in two colors
- Algorithms for Necklace Maps
- A Pascal-like bound for the number of necklaces with fixed density
- Generating necklaces
- Generating bracelets in constant amortized time
- A Gray Code for Necklaces of Fixed Density
- On the generation of aperiodic and periodic necklaces via T-augmentation
Cited in
(39)- A fast algorithm to generate necklaces with fixed content
- Stability structures of conjunctive Boolean networks
- Unweighted linear congruences with distinct coordinates and the Varshamov-Tenengolts codes
- Necklaces and Lyndon words in colexicographic and binary reflected Gray code order
- \(k\)-ary Lyndon words and necklaces arising as rational arguments of Hurwitz-Lerch zeta function and Apostol-Bernoulli polynomials
- On interpolation functions for the number of k-ary Lyndon words associated with the Apostol-Euler numbers and their applications
- Generating bracelets with fixed content
- On the reconstruction of 3-uniform hypergraphs from step-two degree sequences
- Counting the decimation classes of binary vectors with relatively prime length and density
- Ranking and unranking fixed-density necklaces and Lyndon words
- Maximal area sets and harmony
- A Pascal-like bound for the number of necklaces with fixed density
- Finding the largest fixed-density necklace and Lyndon word
- On the reconstruction of 3-uniform hypergraphs from degree sequences of span-two
- Properties of the cycles that contain all vectors of weight k
- Analysis of generating functions for special words and numbers and algorithms for computation
- scientific article; zbMATH DE number 1696649 (Why is no real title available?)
- Generating bracelets in constant amortized time
- Efficient ranking of Lyndon words and decoding lexicographically minimal de Bruijn sequence
- Generating fixed density bracelets of arbitrary base
- Algorithms for Necklace Maps
- A Gray code for fixed-density necklaces and Lyndon words in constant amortized time
- Generating necklaces
- The lexicographically smallest universal cycle for binary strings with minimum specified weight
- scientific article; zbMATH DE number 1305469 (Why is no real title available?)
- TOWARDS AN IMPLEMENTATION OF THE B–H ALGORITHM FOR RECOGNIZING THE UNKNOT
- A Gray Code for Necklaces of Fixed Density
- NECKLACE SWAP PROBLEM FOR RHYTHMIC SIMILARITY MEASURES
- scientific article; zbMATH DE number 1445312 (Why is no real title available?)
- On decompositions of permutation polynomials into quadratic and cubic power permutations
- A characterization of Nichols algebras of diagonal type which are free algebras
- On extremal and near-extremal self-dual ternary codes
- Token graphs of Cayley graphs as lifts
- A general method to find the spectrum and eigenspaces of the k-token graph of a cycle, and 2-token through continuous fractions
- On cardinalities of \(k\)-abelian equivalence classes
- Computational geometric aspects of rhythm, melody, and voice-leading
- New sufficient conditions on the degree sequences of uniform hypergraphs
- More restrictive Gray codes for necklaces and Lyndon words
- Necklaces and bracelets in R
This page was built for publication: An Efficient Algorithm for Generating Necklaces with Fixed Density
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4943839)
