Gray-ordered binary necklaces

zbMATH Open1113.68071MaRDI QIDQ870062FDOQ870062

Authors: Christopher Degni, Arthur A. Drisko 

Publication date: 12 March 2007

Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/127550

File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)

Recommendations

• Gray codes for necklaces
• More restrictive Gray codes for necklaces and Lyndon words
• A Gray Code for Necklaces of Fixed Density
• Gray codes for necklaces and Lyndon words of arbitrary base
• Necklaces and Lyndon words in colexicographic and binary reflected Gray code order

zbMATH Keywords

Gray-code

Mathematics Subject Classification ID

Other designs, configurations (05B30) Combinatorics on words (68R15) Free semigroups, generators and relations, word problems (20M05)

Cited In (6)

• A Gray code for fixed-density necklaces and Lyndon words in constant amortized time
• Binary bubble languages and cool-lex order
• More restrictive Gray codes for necklaces and Lyndon words
• ENUMERATING NECKLACES WITH TRANSITIONS
• On cardinalities of \(k\)-abelian equivalence classes
• Necklaces and Lyndon words in colexicographic and binary reflected Gray code order

This page was built for publication: Gray-ordered binary necklaces

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