Pages that link to "Item:Q4943839"
From MaRDI portal
The following pages link to An Efficient Algorithm for Generating Necklaces with Fixed Density (Q4943839):
Displaying 30 items.
- Necklaces and bracelets in R (Q99679) (← links)
- A Gray code for fixed-density necklaces and Lyndon words in constant amortized time (Q391391) (← links)
- The lexicographically smallest universal cycle for binary strings with minimum specified weight (Q405571) (← links)
- On cardinalities of \(k\)-abelian equivalence classes (Q728280) (← links)
- Computational geometric aspects of rhythm, melody, and voice-leading (Q733549) (← links)
- New sufficient conditions on the degree sequences of uniform hypergraphs (Q831139) (← links)
- More restrictive Gray codes for necklaces and Lyndon words (Q963341) (← links)
- A fast algorithm to generate necklaces with fixed content (Q1400003) (← links)
- Stability structures of conjunctive Boolean networks (Q1640224) (← links)
- Unweighted linear congruences with distinct coordinates and the Varshamov-Tenengolts codes (Q1650802) (← links)
- Necklaces and Lyndon words in colexicographic and binary reflected Gray code order (Q1679610) (← links)
- \(k\)-ary Lyndon words and necklaces arising as rational arguments of Hurwitz-Lerch zeta function and Apostol-Bernoulli polynomials (Q1693363) (← links)
- On interpolation functions for the number of \(k\)-ary Lyndon words associated with the Apostol-Euler numbers and their applications (Q1736983) (← links)
- On the reconstruction of 3-uniform hypergraphs from step-two degree sequences (Q2061815) (← links)
- Counting the decimation classes of binary vectors with relatively prime length and density (Q2114775) (← links)
- Ranking and unranking fixed-density necklaces and Lyndon words (Q2272399) (← links)
- Maximal area sets and harmony (Q2373433) (← links)
- A Pascal-like bound for the number of necklaces with fixed density (Q2420574) (← links)
- Finding the largest fixed-density necklace and Lyndon word (Q2628279) (← links)
- On the reconstruction of 3-uniform hypergraphs from degree sequences of span-two (Q2678917) (← links)
- Properties of the cycles that contain all vectors of weight \(\le k\) (Q2678985) (← links)
- Analysis of generating functions for special words and numbers and algorithms for computation (Q2682861) (← links)
- Efficient Ranking of Lyndon Words and Decoding Lexicographically Minimal de Bruijn Sequence (Q2830442) (← links)
- Generating fixed density bracelets of arbitrary base (Q2875290) (← links)
- TOWARDS AN IMPLEMENTATION OF THE B–H ALGORITHM FOR RECOGNIZING THE UNKNOT (Q4549836) (← links)
- On decompositions of permutation polynomials into quadratic and cubic power permutations (Q6159437) (← links)
- A characterization of Nichols algebras of diagonal type which are free algebras (Q6179266) (← links)
- On extremal and near-extremal self-dual ternary codes (Q6494946) (← links)
- Token graphs of Cayley graphs as lifts (Q6628851) (← links)
- A general method to find the spectrum and eigenspaces of the \(k\)-token graph of a cycle, and 2-token through continuous fractions (Q6648276) (← links)
