Gray-ordered binary necklaces
Summary: A \(k\)-ary necklace of order \(n\) is an equivalence class of strings of length \(n\) of symbols from \(\{0,1,\dots,k-1\}\) under cyclic rotation. In this paper we define an ordering on the free semigroup on two generators such that the binary strings of length \(n\) are in Gray-code order for each \(n\). We take the binary necklace class representatives to be the least of each class in this ordering. We examine the properties of this ordering and in particular prove that all binary strings factor canonically as products of these representatives. We conjecture that stepping from one representative of length \(n\) to the next in this ordering requires only one bit flip, except at easily characterized steps.
- 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)
