Gray-ordered binary necklaces

MaRDI QIDQ870062zbMATH OpenFDO

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, http://www.emis.de/journals/EJC/Volume_14/Abstracts/v14i1r7.html

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

zbMATH Keywords

Gray-code

Mathematics Subject Classification ID

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

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

Cited in

(9)

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

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)