An Efficient Algorithm for Generating Necklaces with Fixed Density
From MaRDI portal
Publication:4943839
DOI10.1137/S0097539798344112zbMath0937.68091OpenAlexW2039582260MaRDI QIDQ4943839
Publication date: 19 March 2000
Published in: SIAM Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/s0097539798344112
Combinatorics in computer science (68R05) Combinatorics on words (68R15) Software, source code, etc. for problems pertaining to combinatorics (05-04)
Related Items (27)
New sufficient conditions on the degree sequences of uniform hypergraphs ⋮ Finding the largest fixed-density necklace and Lyndon word ⋮ Maximal area sets and harmony ⋮ Stability structures of conjunctive Boolean networks ⋮ TOWARDS AN IMPLEMENTATION OF THE B–H ALGORITHM FOR RECOGNIZING THE UNKNOT ⋮ Unweighted linear congruences with distinct coordinates and the Varshamov-Tenengolts codes ⋮ 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 ⋮ A Pascal-like bound for the number of necklaces with fixed density ⋮ On the reconstruction of 3-uniform hypergraphs from degree sequences of span-two ⋮ Properties of the cycles that contain all vectors of weight \(\le k\) ⋮ The lexicographically smallest universal cycle for binary strings with minimum specified weight ⋮ A fast algorithm to generate necklaces with fixed content ⋮ Analysis of generating functions for special words and numbers and algorithms for computation ⋮ \(k\)-ary Lyndon words and necklaces arising as rational arguments of Hurwitz-Lerch zeta function and Apostol-Bernoulli polynomials ⋮ On decompositions of permutation polynomials into quadratic and cubic power permutations ⋮ A characterization of Nichols algebras of diagonal type which are free algebras ⋮ On interpolation functions for the number of \(k\)-ary Lyndon words associated with the Apostol-Euler numbers and their applications ⋮ More restrictive Gray codes for necklaces and Lyndon words ⋮ Ranking and unranking fixed-density necklaces and Lyndon words ⋮ Necklaces and bracelets in R ⋮ On cardinalities of \(k\)-abelian equivalence classes ⋮ Computational geometric aspects of rhythm, melody, and voice-leading ⋮ On the reconstruction of 3-uniform hypergraphs from step-two degree sequences ⋮ Efficient Ranking of Lyndon Words and Decoding Lexicographically Minimal de Bruijn Sequence ⋮ Generating fixed density bracelets of arbitrary base ⋮ Counting the decimation classes of binary vectors with relatively prime length and density
This page was built for publication: An Efficient Algorithm for Generating Necklaces with Fixed Density
