Geodesic
Gray-ordered binary necklaces
The electronic journal of combinatorics, Tome 14 (2007)
Cet article a éte moissonné depuis la source The Electronic Journal of Combinatorics website

Voir la notice de l'article

A $k$-ary necklace of order $n$ is an equivalence class of strings of length $n$ of symbols from $\{0,1,\ldots,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.
DOI : 10.37236/926
Classification : 68R15, 20M05, 05B30
Mots-clés : Gray-code 
@article{10_37236_926,
     author = {Christopher Degni and Arthur A. Drisko},
     title = {Gray-ordered binary necklaces},
     journal = {The electronic journal of combinatorics},
     year = {2007},
     volume = {14},
     doi = {10.37236/926},
     zbl = {1113.68071},
     url = {http://geodesic.mathdoc.fr/articles/10.37236/926/}
}
TY  - JOUR
AU  - Christopher Degni
AU  - Arthur A. Drisko
TI  - Gray-ordered binary necklaces
JO  - The electronic journal of combinatorics
PY  - 2007
VL  - 14
UR  - http://geodesic.mathdoc.fr/articles/10.37236/926/
DO  - 10.37236/926
ID  - 10_37236_926
ER  - 
%0 Journal Article
%A Christopher Degni
%A Arthur A. Drisko
%T Gray-ordered binary necklaces
%J The electronic journal of combinatorics
%D 2007
%V 14
%U http://geodesic.mathdoc.fr/articles/10.37236/926/
%R 10.37236/926
%F 10_37236_926
Christopher Degni; Arthur A. Drisko. Gray-ordered binary necklaces. The electronic journal of combinatorics, Tome 14 (2007). doi: 10.37236/926

Cité par Sources :